Auction methods, auction systems and servers

ABSTRACT

Auction methods, auction systems and servers which can satisfy requirements other than the price for a client are provided. An auction client selects a desired one from time slide schemes from a terminal, and enters a due date in an associated entry field. For example, a due date advance scheme is a scheme in which a person who offers the soonest possible trading date from a due date is determined as a successful bidder. Also, specific details (paying-in, delivery and so on) on the trading date for a payment or delivery of an article, requested to a partner, are specified. These bid condition data are transmitted to the server through a network, and the server collects participants in a bid on a home page. The server receives trading dates offered from terminals of participants, and determines a participant who offers the trading date that most satisfies the trade due date condition offered by the client as a successful bidder.

CROSS-REFERENCES TO RELATED APPLICATIONS

This application is a Division of application Ser. No. 09/864,525, filedMay 23, 2001, now U.S. Pat. No. 7,478,055, issued Jan. 13, 2009.

BACKGROUND OF THE INVENTION

The present invention relates to auction methods, auction systems andservers for conducting an auction on a network.

Conventionally, auction methods of the type mentioned above aredisclosed, for example, in U.S. Pat. No. 5,794,207, Japanese UnexaminedPatent Publications Nos. Hei 10-78992 and Hei 11-328271, among others.These auction methods are such that an auction participant that offersthe best price condition, i.e., a participant (buyer) that offers thehighest price to a seller in a normal auction and a participant (seller)that offers the lowest price for a buyer in a counter-auction, is asuccessful bidder. Generally, a successful bidder should complete thetransaction, i.e., by delivery of the article or the payment of theprice, by a due date previously stipulated by rules.

However, some clients (requesters) who wish to sell or buy articles inan auction have desired to set a date convenient to them for the articledelivery date or for the payment date due for a variety of reasons. Forexample, a client who urgently wishes to sell an art object or anantique object for funds wants to obtain funds as soon as possible onlyif such an object can be sold at a desired price, irrespective ofwhether it is sold at a high price. Also, a person who wants to acquirea desired article may give the highest priority to the earliness of thetrade rather than the price. Further, if there is no place to storesupplied articles until the articles are shipped, a warehouse must berented. Then, it is desired to set an article delivery date immediatelybefore the articles are shipped. Further, if one wants a certain articlebut cannot immediately finance the article, one desires delivery of thearticle at the soonest possible date after payment is made or desires tonegotiate with a seller to offer conditions favorable to him, i.e.,delivery of the article to him prior to the payment. Further, one whowants to sell a product, which is currently in use for business orpleasure, for raising funds for purchasing another product, may want totransact with a buyer who may let him use the product until a latestpossible date, provided that the buyer agrees to purchase the productsat a desired price.

As described above, sellers and buyers who look for counterparts to buyor sell articles have a variety of desires for trading dates such as thearticle delivery date, the payment due date, and so on in accordancewith individuals' circumstances. Conventional auction methods, however,determine a successful bidder without considering such trading dates.Thus, the conventional auction methods have a problem that they fail tofind a trading partner who offers a satisfactory trading date eventhough not at the highest price, fail to give the highest priority to atrading date for looking for a trading partner, and fail to decide thatthe successful bidder is a partner who offers the most favorable tradingdate rather than the soonest one, if there are a plurality of partnerswho have offered the highest price. On the other hand, in acounter-auction, which has been conventionally used for reservations ofair-line tickets and hotels, a buyer offers information related to termssuch as desired flight dates, stay days, and so on, while sellers offerinformation related to terms such as flight dates, stay days, and so onthat meet the requirements. The information on terms in this event doesnot refer to the terms for a trade, so that a payment must be made bythe previously determined due date by a successful bidder. Thus, theconventional auction takes it for granted that participants bid for anarticle on price, so that, although a client is satisfied with hisrequirements in terms of the price, requirements other than price arenot always met. Even if a client gives higher priority to a certainrequirement other than price, conventional auction methods havedifficulties in giving the highest priority to the requirements otherthan price.

For example, when a customer hires a taxi, a counter-auction system maybe employed to select the taxi that offers the lowest rate among aplurality of taxi companies. This scheme allows the customer to selectthe taxi with the lowest rate, but does not take into account where anassigned taxi is located, so that it creates the problem of selecting ataxi extremely far away from the customer (requester).

Generally, for hiring a taxi, a customer communicates with a taxicompany by telephone or the like, and of the taxis the company owns, thetaxi company assigns the taxi nearest to the customer to the customer.However, since the hiring of a taxi in this manner is conducted onlywith a single taxi company, a taxi belonging to another taxi company maybe located closer to the customer, so that the taxi closest to thecustomer is not always assigned to the customer. Therefore, there is theproblem that a customer cannot select the taxi positioned closest tohim.

Turning back to the discussion of auctions, some auction participantsmay desire to trade articles with a numerical value in accordance with,for example, the longest (shortest), heaviest (lightest), most (least)articles, and so on due to a variety of circumstances. For example, aclient who desires to purchase the longest possible article may desireto trade with a seller who offers the longest article irrespective ofthe price from among auction participants. In other words, some clientswho participate in an auction may want to give a higher priority to acertain numerical value rather than the price as a bid condition in atrade. However, since conventional auction methods allow bidders tocompete only regarding the price, such methods cannot be applied to anauction in which competition is made with some numerical value otherthan the price.

Also, some clients who request sale and purchase of articles in anauction may desire to reflect their requirements in articles due to avariety of circumstances. For example, a client who wants to purchase anart object or an antique object may want to purchase such an object atthe most reasonable price in consideration of various conditions such asthe created year, the custody history, scratches and so on. As anotherexample, for purchasing a personal computer through an auction, while aclient has specific requirements concerning the image quality of anassociated display, the quality, the performance and processing speed ofthe computer itself, and so on, he does not know in some cases whichproduct (model numbers or the like) most meets his requirements. As afurther example, for requesting an engagement with a private tutor, aclient, though having requirements, does not know how to select aspecific private tutor based on criteria. Therefore, clients mustintuitively narrow down products or persons that meet the requirementsto some degree, and bid off one of such narrowed products or servicesfinally on price. There is also a problem that trading partners arevirtually limited to those who have been registered in an auction. Onthe other hand, some sellers desire that an offered product be purchasedby a buyer who most understands the value of the product.

As described above, since conventional auctions take it for granted thatparticipants bid for an article based on price, although a client issatisfied with his requirements in terms of the price, requirementsother than the price are not always met. Even if a client gives higherpriority to a requirement other than the price, conventional auctionmethods make it difficult to give the highest priority to therequirement. In addition, at present, a trade can be made only withtrading partners who participate in an auction for offering products orservices or those who want to offer articles or services.

SUMMARY OF THE INVENTION

The present invention has been achieved for solving the problemsdescribed above, and its first object is to provide an auction method,an auction system and a server which can satisfy requirements other thanthe price for a client.

It is a second object of the present invention to provide an auctionmethod, an auction system and a server that permit a client who looksfor a partner, with whom an article is sold or purchased, to find atrading partner who meets desired conditions in accordance with theclient's circumstances with respect to trading dates such as the articledelivery date, the payment deadline, and the like.

It is a third object of the present invention to provide an auctionmethod, an auction system and a server that can achieve the first objectas well as meet requirements with respect to the position of a client(requester).

It is a fourth object of the present invention to provide an auctionmethod, an auction system and a server that can achieve the first objectas well as permit a client who seeks a partner, with whom the client cantrade an article or a service, to bid for the article or the servicewith a numerical value associated with the article or the service andfind a trading partner who offers terms and conditions, including thenumerical value, that meet desired requirements of the client.

It is a fifth object of the present invention to provide an auctionmethod, an auction system and a server that can achieve the first objectas well as find a trading partner who offers an article or a servicethat best meets even abstract requirements, for example, a requirementthat cannot be represented by a numerical value such as a price.

It is a sixth object of the present invention to provide an auctionmethod, an auction system and a server that achieve the first object aswell as permit a person who requests rescue when he has encountered adisaster or the like to use an auction system to request a rescue party,for rescue, who can reach the spot of the rescue at the soonest possibletime for rapid rescue activities.

In order to achieve these objects, in accordance with the presentinvention, there is provided a method of conducting an auction forbidding off an article or a service, or a person who receives provisionof an article or a service, through a network, said method comprising:

a collection procedure in which an auction intermediary server providesinformation serving as a reference for bidding an article or a serviceto be traded, and transmits collection information to collect bidsrequesting to offer an element other than a price or convertedinformation converted to said element, as an object to be bidden, toterminals through the network;

a bid procedure in which said server receives bid information includingsaid element or said converted information offered by bidders fromterminals of the bidders through communications via the network; and

a bid acceptance procedure in which said server executes bid processingfor finding a result of bidding with said element included in said bidinformation or an element derived by converting said convertedinformation, based on said bid information, to select a successfulbidder.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic diagram generally illustrating the configurationof a time auction system according to an embodiment of the presentinvention;

FIG. 2 is a functional block diagram illustrating the functionalconfiguration of an auction management system;

FIG. 3 illustrates a home page of a time auction;

FIG. 4 is an explanatory diagram regarding registration of a user;

FIG. 5 is an explanatory diagram regarding registration of an article;

FIG. 6 is an explanatory diagram regarding desired condition setting onthe client side;

FIG. 7A is an explanatory diagram for a time slide scheme that is a duedate advance scheme;

FIG. 7B is an explanatory diagram for a time slide scheme that is a duedate delay scheme;

FIG. 7C is an explanatory diagram for a time slide scheme that is aclosest pre-due date scheme;

FIG. 7D is an explanatory diagram for a time slide scheme that is aclosest post-due date scheme;

FIG. 8 is an explanatory diagram about setting of a price slide settingform;

FIG. 9 is an explanatory diagram for setting on the bidder side;

FIG. 10 is a flow chart illustrating a registration processingprocedure;

FIG. 11 is a flow chart illustrating a due date slide based timeauction;

FIG. 12 is a flow chart illustrating a price slide setting based timeauction;

FIG. 13 is an explanatory diagram for a bidding priority setting;

FIG. 14 illustrates a list screen;

FIG. 15 is a schematic diagram generally illustrating the configurationof an auction system according to a second embodiment of the presentinvention;

FIG. 16 is a functional block diagram illustrating the functionalconfiguration of an auction management system;

FIG. 17A is a schematic diagram of a taxi equipped with GPS;

FIG. 17B is a schematic diagram of a portable telephone equipped withGPS;

FIG. 18 illustrates a home page of an auction;

FIG. 19 is a diagram illustrating a screen for hiring a taxi;

FIG. 20 is a diagram illustrating a screen for participating in anauction;

FIGS. 21A and 21B are explanatory diagrams of a position auction;

FIG. 22 is a flow chart illustrating a procedure of the positionauction;

FIG. 23 is a flow chart illustrating a procedure of an on-the-moveposition auction;

FIG. 24 illustrates a home page of an auction according to anotherembodiment;

FIG. 25 is an explanatory diagram for registration of an article or aservice according to a third embodiment of the present invention;

FIG. 26 illustrates a screen for selecting a range;

FIGS. 27A through 27E are explanatory diagrams regarding priority rulesfor the position auction;

FIG. 28 is an explanatory diagram regarding the on-the-move positionauction;

FIG. 29 illustrates a screen showing a list;

FIG. 30 illustrates a screen for confirming a customer in theon-the-move position auction;

FIG. 31 is a flow chart illustrating a position auction procedure;

FIG. 32 illustrates a screen for providing information on a school offish according to a fourth embodiment of the present invention;

FIG. 33 illustrates a screen for participating in an auction;

FIG. 34 is an explanatory diagram regarding registration of information;

FIG. 35 is a flow chart illustrating a position auction procedure;

FIG. 36 is a flow chart illustrating a general-purpose position auctionprocedure;

FIG. 37 is a block diagram illustrating the functional configuration ofan auction management system according to a fifth embodiment of thepresent invention;

FIG. 38 illustrates a screen for selecting a specific numerical valuewhich is displayed when a specific numerical value is selected;

FIG. 39 is an explanatory diagram regarding registration of an articleor a service;

FIG. 40 is an explanatory diagram regarding selection of a bidding form;

FIG. 41 is an explanatory diagram regarding participation in an auction;

FIG. 42 is an explanatory diagram regarding provision of information;

FIG. 43 illustrates a screen showing a list;

FIGS. 44A through 44E are explanatory diagrams regarding priority rulesfor a numerical value auction;

FIG. 45 is a flow chart illustrating a procedure of the numerical valueauction;

FIG. 46 is a schematic diagram illustrating the configuration of atrading system according to a sixth embodiment of the present invention;

FIG. 47 illustrates a home page of an auction;

FIG. 48 is an explanatory diagram for explaining a request registrationprocedure;

FIG. 49 illustrates a request registration screen for registering a keyword;

FIG. 50 illustrates a request registration screen for registering a keyword different from that in FIG. 49;

FIG. 51 illustrates a request registration screen for registering a keyword different from that in FIG. 50;

FIG. 52 is an explanatory diagram for explaining a bid registrationprocedure;

FIG. 53 is an explanatory diagram for explaining an informationprovision based bidding procedure;

FIG. 54 illustrates a screen for displaying evaluation results;

FIG. 55 is a table showing evaluation data;

FIG. 56 is a table showing data of calculations;

FIG. 57 is a flow chart illustrating a procedure of an auction;

FIG. 58 is a flow chart illustrating a procedure of an evaluationauction;

FIG. 59 illustrates an element selection screen according to a seventhembodiment of the present invention;

FIG. 60 illustrates a screen for selecting a bidding system;

FIG. 61 illustrates a screen for providing information;

FIGS. 62A through 62D are explanatory diagrams regarding bidding forms;

FIG. 63 illustrates a screen for setting an element priority;

FIG. 64 illustrates a screen showing a list;

FIG. 65 is a flow chart illustrating an element auction procedure;

FIG. 66 is a flow chart illustrating a numerical value evaluationauction procedure;

FIG. 67 is a schematic diagram generally illustrating the configurationof a private rescue system according to an eighth embodiment of thepresent invention;

FIG. 68 is a schematic diagram generally illustrating the configurationof a private rescue system that is different from the system of FIG. 67;

FIG. 69 illustrates an auction home page provided by the private rescuesystem;

FIG. 70 illustrates a screen for registering a user;

FIG. 71 illustrates a screen for requesting for a rescue;

FIG. 72 illustrates a screen for participating in an auction;

FIGS. 73A and 73B are explanatory diagrams when a server selects arescue ship;

FIG. 74 is a flow chart illustrating a procedure of an auction;

FIG. 75 is a schematic diagram illustrating the configuration of atrading system; and

FIGS. 76A through 76C are schematic diagrams illustrating auction forms.

DESCRIPTION OF THE PREFERRED EMBODIMENTS First Embodiment

A first embodiment which embodies the present invention will hereinafterbe described with reference to FIGS. 1 through 14. FIG. 1 illustrates atime auction system for sellers and buyers to conduct auctions forarticles through a network. In this example, an auction is held in whichan article is bid for with time as an element.

The time auction system 10 includes an auction management system 20, anetwork (for example, the Internet) N, and terminals 30 for users(customers). The auction management system 20 in turn includes a server(web server) 21, a customer management database (DB) 22, an articlemanagement database (DB) 23, and a bidding management database (DB) 24.It should be noted that the server 21 may be configured by a separateweb server and an application server.

FIG. 2 illustrates the functional configuration of the auctionmanagement system 20. The auction management system 20 comprises acommunication unit 41, a control unit 42, a time bid computing unit 43,and a bid narrow-down computing unit 44. The communication unit 41,control unit 42, time bid computing unit 43 and bid narrow-downcomputing unit 44 are implemented by a server 21. The communication unit41 operates in accordance with a predetermined communication protocol(HTTP). The article management DB 23 comprises a bid condition storageunit 45, which includes a time bid data storage unit 45A and anarrow-down data storage unit 45B. The control unit 42 and therespective computing units 43, 44 are used in computing control foridentifying a successful bidder in a time auction, and a variety of datastored in the respective storage units 43A, 45B are used for thiscomputing.

A time auction home page (HP) (site) resides in the server 21, such thata user displays the time auction HP illustrated in FIG. 3 on a screenthrough the network N using a browser application from a terminal 30.The user can register or participate in an auction by entering requireddata on the time auction HP. Any user who has completed a userregistration procedure is allowed to request purchase and/or sale ofarticles in the time auction or to participate in the time auction.

The time auction HP has a variety of screens linked thereto, including auser registration screen P illustrated in FIG. 4; an articleregistration screen Q illustrated in FIG. 5; a time bid scheme selectionscreen R illustrated in FIG. 6; a desired condition setting screen S; aslide price setting screen T illustrated in FIG. 8; and so on. Theserver 21 stores on its hard disk screen data for the variety of screensHP, P, Q, R, S, T, a program for use in displaying the screens and so on(for example, an HTML description program), a program for use incomputing processing involved in the auction, and so on.

As illustrated in FIG. 3, the time auction HP is provided with a largenumber of selection buttons 51, which are classified according toarticles possibly traded in an auction, and a large number of selectionbuttons 52, which are classified according to articles possibly tradedin a counter-auction. A person who wants to participate in a bid(bidder) selects any of the selection buttons 51, 52 for classifyingarticles. It should be noted that FIG. 3 illustrates only a portion ofthe article classifications. The time auction HP is also provided with auser registration button 53 and an article registration button 54. Therespective buttons 53, 54, when selected by the user, results indisplaying the registration screen P (FIG. 4) and the registrationscreen Q (FIG. 5), respectively.

As illustrated in FIG. 4, the user registration screen P is providedwith options P1 for selecting whether the user wants to participate inan auction as a seller or a buyer, and a variety of entry fields P2 forentering address, name, telephone number, electronic mail address, sex,age, remarks, and so on. When the user has entered all required items inassociated fields on the user registration screen P displayed on theterminal 30A and selects an OK button 55, the just entered userregistration data D1 is transmitted to the server 21 through the networkN and added to customer management data stored in the customermanagement DB 22. Upon confirming that the user has paid a predeterminedcommission, the server 21 transmits an authentication number (ID andpassword) to the terminal 30A of the just registered user. Theregistered user uses the authentication number for utilizing the timeauction. If the user is not yet definite whether he will use the timeauction as a seller or a buyer at the time of the user registration, theuser may register in this respect at a later time.

As illustrated in FIG. 5, the article registration screen Q is providedwith a variety of entry fields Q1 to Q7 for entering articleclassification, article name, desired price, quantity, quality, custodyplace, article information, and so on. A range of values may be set inthe field Q3 for entering a desired price. Also, the articleregistration screen Q is provided with options Q8 for selecting adesired price from three types: a fixed price, a slide price, and aminimum price. Here, fixed price means that the price is fixed. A slideprice is a price that is set to vary in association with each of aplurality of trade terms along a time axis. For example, a slide priceis used by a manufacturer that, upon accepting advanced orders for a newproduct, sets a price that becomes gradually lower as more days elapsefrom the announcing date to encourage more persons to buy the newproduct. The minimum price is the minimum acceptable bid. When thisoption is selected, an associated bidder should offer a limit price. Theentry field Q6 is a field for entering (selecting) a current custodyplace for an article, and may be filled in with such items as custody byan auction management dealer, private custody organization, seller'swarehouse, schedule for manufacturing, and so on. The entry field Q7 isfilled in with a detailed description of an associated article. Thedesired price entered on this screen Q corresponds to sales priceinformation or purchase price information.

When the user has entered required items in all fields on the articleregistration screen Q displayed on the terminal 30A and selects an OKbutton 56, article registration data D2, as article related information,is transmitted to the server 21 through the network N and added toarticle management data in the article management DB 23. Also, when thefixed price or the minimum price is selected in the options Q8, the timebid scheme selection screen R and the desired condition setting screen Sillustrated in FIG. 6 are displayed on the terminal 30A. Alternatively,when the slide price is selected in the options Q8, the slide pricesetting screen T illustrated in FIG. 8 is displayed on the terminal 30A.

As illustrated in FIG. 6, the time bid scheme selection screen R isprovided with six options R1 to R6 for selecting a particular time slidescheme. The options R1 to R6 provide a “due date advance scheme”, a “duedate delay scheme”, and a “due data approach scheme” for a seller and abuyer, respectively. In addition, the “due date approach scheme” isprovided with options R7, R8 for selecting either “before due date” or“after due date”.

FIGS. 7A through 7D explain how a bid is conducted in each of the fourtypes of time slide schemes provided for a seller and a buyer. The “duedate advance scheme” in FIG. 7A is a scheme that preferentiallydetermines a successful bidder as the person (bidder) who has offeredthe earliest possible trading date prior to the due date specified by aclient (requester). Among bidders A, B, C who have offered trading datesprior to the specified due date, the bidder C, who has offered theearliest trading date, is determined to be the successful bidder.

The “due date delay scheme” in FIG. 7B is a scheme that preferentiallydetermines that the person who has offered the latest possible tradingdate after a due date specified by a client is the successful bidder.Among bidders A, B, C who have offered trading dates after the specifieddue date, the bidder C who has offered the latest trading date isdetermined as a successful bidder.

A “closest pre-due date scheme” in FIG. 7C is a scheme thatpreferentially determines the successful bidder to be the person who hasoffered a trading date prior to and as close as possible to the due datespecified by a client. Among bidders A, B, C, who have offered tradingdates prior to the specified due date, bidder C has offered the latesttrading date and is determined to be the successful bidder.

A “closest post-due date scheme” in FIG. 7D is a scheme thatpreferentially determines the successful bidder to be the person who hasoffered a trading date that is after and as close as possible to a duedate specified by a client. Among bidders A, B, C, who have offeredtrading dates after the specified due date, bidder C has offered thelatest trading date and is determined to be the successful bidder. Itshould be noted that in either of the time bid schemes, if a number ofbidders exceeding an upper limit of number of bidders compete on themost favorable trading date (for example, when two bidders C, D competeon a favorable trading date for a limit of one bidder as illustrated inFIG. 9), the bidders are narrowed down to a successful bidder based onpredetermined rules, later described.

The desired condition setting screen S illustrated in FIG. 6, in turn,is provided with entry fields S1 to S4 for entering a specified due date(reference time), payment, article delivery period, and bidding period,and options S5 for selecting whether or not a bidder is allowed to offera condition. The entry field S1 specifies a due date, which serves as areference time in the time slide scheme.

As a trade is established, a client and a successful bidder proceed withpayment for an article and delivery of the article. The entry fields S2,S3 are fields for setting a specific request from the client on atrading date offered by a successful bidder in the payment or thedelivery of the article. The entry field S2 for “payment” is availablewhen a client is a seller, while the entry field S3 for “articledelivery” is available when a client is a buyer.

In the “payment” entry field S2, the client can select which of aplurality of options such as a paying-in date, bank transfer date, cashdispatch date, money collection date, electronic money payment date,first payment date of partial payment, down-payment making date, or thelike is defined as the trading date. In the “article delivery” entryfield S3, the client can select which of a plurality of options such asa delivery date, article shipment date, assignment issuing date, titledocument transfer date, contract date, occupation date (for a residenceor the like), title transfer data, or the like is defined as the tradingdate. For each of these items, though not shown, it is also possible toset a period based on the trading date, for example, a period of acertain number of days after the trading date, within a period of acertain number of days (or certain number of weeks) from the tradingdate, or the like. A seller or a buyer, who is a client, sets specificcontents and the desired due date (period) in accordance with theindividual's circumstances with respect to payment or delivery of anarticle. Particularly, when the client has a desired due date for apaying-in date or a delivery date, the client may have bidders competebased on such a trading date to find a trading partner who is offering afavorable trading date for the client. This is a major advantage of thetime auction system. Upon selection of an “OK” button 57 after requireditems have been entered on the screens R, S, bid condition data D3comprised of data contents entered on the respective screens R, S istransmitted to the server 21.

As illustrated in FIG. 8, the slide price setting screen T in turn isprovided with separate entry fields T1 for setting a plurality (three inthe illustrated example) of periods; separate entry fields T2 forsetting prices for the plurality of periods; and a field T3 for enteringa bidding period. The respective entry fields T1 set periods (firstthrough third periods) shifted from each other in a step-wise mannerwith respect to a time axis. The respective entry fields T2 set pricescorresponding to the respective periods such that the price changes fromone to another in association with a transition from one period toanother. The slide price setting screen T may be used, for example, by amanufacturer (maker) that accepts advanced orders for new productsthrough the price slide setting type time auction to distribute ordersconcentrated in an initial period immediately after the release of theproducts to the market and to review a production plan in accordancewith a sales prediction based on the result of the bidding.

Further, not limited to manufacturers, the price slide setting type timeauction may be used by clients who want to sell or buy a large number ofarticles efficiently or for selling or buying an article at anappropriate price for a particular trading period (for example, anarticle, such as a book, a music DC or the like, the value of whichdecreases over time from a release date). It should be noted that evenwith the price slide setting type time auction, the client can make anoffer arbitrarily. For example, the price slide setting type timeauction can set priority rules that may be applied when there is onlyone article to preferentially determine that the successful bidder is abidder who satisfies a single combination desired by the client even ifa number of bidders satisfy all of a plurality of combinations withrespect to a period and a price. The auction may have priority rules fordetermining a bidder for each period. Then, upon selection of an “OK”button 58 after required items have been entered on the screen T, bidcondition data D4 including the data contents entered on the screen T istransmitted to the server 21. As appreciated, the items set on thescreens R, S in FIG. 6, except for the bidding period, correspond totrade period conditions, while the items set on the screen T in FIG. 8,except for the bidding period, correspond to trade period conditions.Also, the article registration data D2 and the bid condition data D3, D4constitute bid request information as bid information, and the screensR, S, T correspond to requesting screens.

FIGS. 10, 11, and 12 are flow charts illustrating a registrationprocessing procedure for the time auction; a processing procedure forthe period slide type time auction; and a processing procedure for aprice slide setting type time auction, respectively.

An explanation is first given of the registration processing procedurefor the time auction illustrated in FIG. 10. First, in step (hereinaftersimply denoted as “S”) 10, a user registration (customer registration)is made (see FIG. 4). In S20, an article registration is made (see FIG.5).

In S30, it is determined which of the time slide scheme and the priceslide setting type has been selected. It is recognized that the timeslide scheme has been selected when the fixed price or the minimum pricewas selected in the options Q8 on the article registration screen Q ofFIG. 5, followed by the time bid scheme selection screen R of FIG. 6displayed on the terminal 30A. Alternatively, it is recognized that theprice slide setting type has been selected when the slide price wasselected in the options Q8, followed by the slide price setting screen Tof FIG. 8 displayed on the terminal 30A.

In S40, the time slide scheme is selected (see FIG. 6). Each of thesellers and buyers selects one from the four types of time bid schemesdisplayed on the screen R of FIG. 6, i.e., due date advance scheme, duedate delay scheme, closest pre-due date scheme and closest post-due datescheme. It should be noted that while, in this example, the due date isused as the reference time for the time bidding, the reference time mayemploy a function that sets hours, minutes, seconds, weeks, months, oryears. In this event, the due date, which serves as the reference timefor a time slide scheme selected from the four types, is set in theentry field S1 in FIG. 6.

In S50, specific contents meant by a trading date with respect to apayment for or a delivery of an article are set in detail. For example,when the client is a seller and wants to define the trading date as apaying-in date, the client may select “paying-in” in the input field S2.On the other hand, when the client is a buyer and wants to define thetrading date as a delivery date, the client may select “delivery” in theinput field S3.

In step S60, a narrow-down condition is set by the options S5. Forexample, for a seller who wants to ensure funds as soon as possible, itis advantageous that an offered article is bidden off by a tradingpartner who buys the article at a price higher than a desired price aslong as a paying-in date is ensured. Alternatively, for a seller whowants to maintain an article at hand as long as possible, it isadvantageous that the article is bidden off by a trading partner whooffers an article delivery date later than a payment date. Therefore, ifa plurality of bidders exceeding a limited number of bidders competewith the trading date, the client selects “possible” in the item“condition offered from bidder” on the screen S in order for a bidder tooffer information for narrowing the bidders down to those who offer morefavorable conditions for the client. Then, when the client is a seller,the options “price” and “article delivery date” are selected, by way ofexample, as information offered by bidders (buyers) (see FIG. 6).Alternatively, when the client is a buyer, the options “price” and“payment date” are selected, by way of example, as information offeredby bidders (sellers). It should be noted that the entered contents onthe screen R and the due date specified on the screen S correspond tothe bid conditions.

On the other hand, when the price slide setting type has been selected,slide periods are set in S70 on the slide price setting screen T of FIG.8. For example, three periods including a first period to a third periodmay be set. However, the number of set slide periods is not limited tothree and may be four or more. Also, each slide period can be set inarbitrary time units of years, months, weeks, days, hours, minutes, orseconds. It should be noted that the contents entered on the screen Tcorrespond to the bid conditions.

In next S80, slide prices are set. More specifically, pricescorresponding to the respective previously set periods are set such thatthe prices changes from one to another in association with a transitionof the periods from one to another. The price slide setting type may beused, for example, when a manufacturer (maker) uses the time auction foraccepting advanced orders for a new product or predicting sales of thenew product. Set as the slide periods may be a new product releaseperiod, an intermediate sale period in which the product becomes lesspopular, and a final sale period before a next new product is released.Then, a standard price, a discounted price (for example, 10% discount),and a disposal value (for example, 30% discount) are set as the slideprice for the respective periods. The price slide setting typefacilitates the production plan since the manufacturer can acceptadvanced orders over a long period of time from a release day, and helpsreview the production plan by predicting the sales from resultingorders.

In S90, a bidding period is set. In the time slide scheme, the biddingperiod is set on the screen S of FIG. 6, while in the price slidesetting type, the bidding period is set on the screen T of FIG. 8.Selecting an OK button 57 or 58 on the screen S or T, data so farentered is transmitted.

In S100, a commission is paid. Also, if an article is expensive enoughto exceed a predetermined price, a margin should be paid in addition tothe commission.

In S110, upon confirmation of the paid commission (including themargin), a time auction is started. Specifically, as one accesses thetime auction HP, he can view articles and their trading conditions onthe screen of the terminal 30 through the network N, so that an articleoffered by a seller is sold at auction, or an article whose purchaseconditions are offered by a buyer is bid at counter-auction. Also, thebid condition data D3, D4 received in this event are stored in the timebid data storage unit 45A if they are related to the time slide schemeand the price slide setting type, and in the narrow-down data storageunit 45B, if they are narrow-down condition data for use in narrowingdown bidders. The procedure from S20 to S100 corresponds to a requestprocedure.

Next, a method of participating in the time auction will be explained.

The time auction HP illustrated in FIG. 3 classifies potential articlestraded thereon into marketable securities, real estate, condominium forsale, ticket, new product, antique and art objects, and so on. As aperson clicks on a button 51 or 52 associated with an article which hewants to sell at auction, the article list screen U illustrated in FIG.9 is displayed on the terminal 30. The button 51 is provided forauction, while the button 52 is provided for counter-auction.

The article list screen U displays a photograph U1 and an article codenumber of each article, as well as article related information such asarticle name, desired price, quantity, and so on; and bid conditioninformation such as time auction system, desired trading date (duedate), bidding period and so on for each article. The article listscreen U of FIG. 9 is displayed in the same form as well when acounter-auction is conducted. Since the article list screen U provides aparticipation button 59 for each article, one may select theparticipation button 59 for participating in a bid. The selection of thebutton 59 results in a bid participation screen V displayed on theterminal 30.

As illustrated in FIG. 9, the bid participation screen V displaysarticle bid condition information V1 such as article code number,article name, desired price, detailed definition of a trading date(here, “paying-in”), time auction system (here, “due date advance”), duedate, and so on, and is provided with entry fields V2 to V5, and anentry field for entering a traded quantity (not shown). This screen V isprovided for a buyer, so that only “paying-in” can be entered in apayment selection field V3 provided for a trading date when a sellerrequests for paying-in. Entry fields V4, V5 for offering conditions aredisplayed when a seller participates in an auction on condition thatbidders offer conditions for purchase. For offering conditions, a bidderselects “YES” in condition offer options V6 before entering conditionswhich the bidder can offer in the entry fields V4, V5 (at least one ofthe price and the article delivery date). Then, upon selecting an OKbutton 60 on the screen V, bid data D5 is transmitted to the server 21and stored in the bid management DB 24. The server 21 sequentiallyexecutes the computing process for determining a successful biddercandidate based on the bid data transmitted thereto from the terminal30B. The screens U, V correspond to bid screens, while the bid data D5corresponds to bid information.

Next, a processing procedure involved in the due date slide type timeauction will be explained with reference to FIGS. 2 and 11.

It is first determined in S210 whether or not any bid has been applied,and if there is any bid applied, all bid data D5 including that of newlyapplied bids are ordered such that higher priorities are given to thosebids that satisfy more time conditions for the due date slide scheme inS220 to create a priority list that enumerates bidders in the priorityorder. More specifically, upon receipt of data of new bids, the controlunit 42 reads time condition data (here conditions for the time slidescheme) from the time bid data storage unit 45A in the articlemanagement database 23, and also reads all bid data associated with anarticle code number involved in this auction from the bid managementdatabase 24. Then, the time bid computing unit 43 uses this data tocompare trading dates in the respective data with the time condition tocreate a priority list which enumerates the bidders in the priorityorder. Subsequently, the computing unit 43 selects a bidder who offers atrading date that most satisfies the time condition as a successfulbidder candidate. It should be noted that the procedure in S210, wherethe screens U, V are displayed on terminals 30 of bidders, and theserver 21 receives the bid data D5 upon receipt of applied bids,corresponds to a bid procedure. Also, the procedure in S210 through S280for determining a successful bidder corresponds to a bid acceptanceprocedure.

A client (for example, a seller) confirms a bidding situation on thescreen of his terminal 30A and transmits a bid acceptance indication tothe server 21 when a successful bidder candidate offers a desiredtrading date, even before the expiration of a bidding period.Conversely, when there is no bidders even if the client confirms abidding situation on the screen, or when no bidder has offered desiredconditions for a long time, the bid conditions (due date (period),price, and so on) may be changed even before the expiration of thebidding period.

In S230, when the server 21 receives a bid acceptance indication fromthe client, the flow continues to S270. In S240, if the server 21receives an instruction to change the bid conditions from the terminal30A of the client, the bid condition data stored in the bid conditionstorage unit 45 is changed. Then, unless no bid acceptance indication isreceived from the terminal 30A of the client, the processing procedurefrom S210 to S260 is repeated to collect bidders until the expiration ofthe bidding period is determined in S260. Then, upon confirming theexpiration of the bidding period in S260, the flow continues to S270.

In S270, it is determined whether or not the number of successful biddercandidates exceeds a limited number of successful bidders. When it isdetermined that the number of successful bidder candidates exceeds,narrow-down processing is executed in S280.

In the narrow-down processing in S280, the control unit 42 readsnarrow-down condition data from the narrow-down data storage unit 45B inthe article management DB 23, and also reads all bid data associatedwith an article code number of the article from the bid management DB24. Then, the bid narrow-down computing unit 44 uses these data toperform appropriate processing for narrowing down a successful bidderfrom the successful bidder candidates. Then, in S290, the bidnarrow-down computing unit 44 notifies the respective terminals 30 ofthe client and the successful bidder of the result of the bid.Subsequently, a trading contract is concluded between the client and thesuccessful bidder. It should be noted that the procedure from S210 toS290 corresponds to a bid acceptance procedure.

Next, a processing procedure of the price slide setting type timeauction will be explained with reference to FIGS. 2 and 12.

After entering required details on offers by selecting a combination ofdesired period and price in the entry fields V2, V4 on the bidparticipation screen V in the same form as that illustrated in FIG. 9(note that a portion of entry items is different), as the OK button 60is selected, bid data D5 is transmitted to the server 21. The bid dataD5 is stored in the bid management DB 24.

It is first determined in S310 whether or not any bid has been applied,and if there is a bid applied, all bid data D5 including those of newlyapplied bids are arranged in successful bid priority order for each ofthe periods in S320 to create a priority list. More specifically, uponreceipt of new bid data, the control unit 42 reads time bid conditiondata (here, conditions for the price slide setting type) from the timebid data storage unit 45A in the article management DB 23, and alsoreads all bid data associated with an article code number involved inthis auction from the bid management DB 24. Then, the time bid computingunit 43 uses these data to compare trading dates presented in respectivedata with one another to create a priority list which enumerates biddersin a priority order for each of the periods. Then, the bidder who hasoffered the trading date that most satisfies a time condition isselected as a successful bidder candidate. However, if the timecondition consists only of the period specified by the client, thepriority list is created by arranging bidders in order from the onewhich was accepted first. In this event, all bidders are determined assuccessful bidders. It should be noted that the procedure in S310,wherein the bid screen is displayed on terminals 30 of bidders, and theserver 21 receives the bid data D5 upon acceptance of applied bids,corresponds to a bid acceptance procedure. Also, the procedure from S310to S400 corresponds to the bid acceptance procedure as well.

The client (for example, a manufacturer or the like which acts as aseller) confirms a bidding situation on his own terminal 30, andtransmits a bid acceptance indication to the server 21 even before theexpiration of the bidding period if a scheduled number of successfulbidder candidates are ensured. Conversely, when there is few bidderseven if the client confirms a bidding situation on the screen, the bidconditions (period, price) may be changed even before the expiration ofthe bidding period.

When the server 21 receives the bid acceptance indication from theclient in S330, the flow continues to S370. Alternatively, when theserver 21 receives an instruction to change the bid conditions from theclient in S350, the server 21 changes the bid condition data (period andprice) stored in the bid condition storage unit 45. Then, unless theclient sends the bid acceptance indication, the processing procedurefrom S310 to S360 is repeated to collect bidders until it is determinedin S360 that the bidding period has expired.

Then, upon confirming the expiration of the bidding period in S360, theserver 21 analyzes, for example, an article sale prediction using thetotalized data in S370. Then, it is determined in S380 whether or notthe number of successful bidder candidates exceeds a limited number ofsuccessful bidders. When it is determined that the number of successfulbidder candidates exceeds the limit, the flow continues to S390.

In the narrow-down processing in S390, the successful bidder candidateson the priority list created by the time bid computing unit 43 arenarrowed down to the limited number of bidders from the top of the listwhich are determined as successful bidders. Then, in S400, the result ofaccepted bids is notified to the terminals 30B of the successfulbidders, while the client is notified of the result of accepted bids,and the totalized data and the result of the analysis on the data asrequired on the terminal 30A of the client. Subsequently, a tradingcontract is concluded between the client and the successful bidder.

As an alternative way of conducting the price slide setting typeauction, it is possible to assume an auction system in which a selleronly offers step-wise periods, while a buyer offers a single periodselected from the offered periods together with a price (purchaseprice). As another alternative way, it is possible to assume an auctionsystem in which a seller only offers step-wise prices, while a buyeroffers a single price selected from the offered prices together with atrading date. Of course, a buyer can act as a client of the price slidesetting type time auction.

Further alternatively, a bid acceptance priority order setting screen WAmay be provided for setting priority levels to elements of conditionsfor a client to determine an accepted bid, for example, as illustratedin FIG. 13. The setting screen WA is provided with a plurality of entryfields WA1 to WA4, and is used, for example, in combination with thescreens R, S in FIG. 6. A client has previously registered a rank ofelements which are preferred in determining a successful bidder, andselects an OK button 61 on the screen WA, for example, to transmitpreferred condition data Da to the server 21. For example, with “tradingdate” set in the entry field WA1 and “price” set in the entry field WA2,the highest priority is given to the trading date, in which case, when aplurality of bidders compete with the same trading date, the bidders arenarrowed down based on elements at the second and lower priority levelssuch as the price and so on to identify a favorable trading partner inaccordance with the priority desired by the client. Alternatively, with“price” set in the entry field WA1 and “trading date” set in the entryfield WA2, the highest priority is given to the price, in which case,when a plurality of bidders compete with the same price, the bidders arenarrowed down based on elements at the second and lower priority levelssuch as the trading date to identify a favorable trading partner inaccordance with the priority desired by the client. In this case, sincethe trading period is taken into account, it is possible to find atrading partner who offers a favorable condition for the trading date aswell. As possible elements which may be ranked in the priorityhierarchy, several elements are provided other than the trading date andthe price.

Alternatively, instead of the method of determining a successful bidder,conducted by the server 21, a trading partner may be determined in thefollowing manner. For example, the server 21 lists information offeredby bidders as it is, or creates a priority list by narrowing downsuccessful bidder candidates at higher ranks, for example, to a limitednumber of bidders specified by the client based on the informationoffered by the bidders, and transmits the list to the terminal 30A ofthe client. Accordingly, a list screen XA as illustrated in FIG. 14 isdisplayed on the terminal 30A of the client. The screen XA is providedwith a list XA1, an entry field XA2 for selecting a successful bidder,and an OK button 62. The list XA1 indicates a priority number, a codenumber, a trading date (date offered by a bidder), and bidder offeredconditions (price, article delivery date and so on).

The client reviews offered conditions such as the trading dates in thelist XA1 of the screen XA, determines a successful bidder favorable tothe client, enters, for example, the priority number of the successfulbidder in the entry field XA2, and selects the OK button 62. Inresponse, the server 21 notifies the client and the successful bidder ofan accepted bid. If the client can view the list XA1 on the terminal 30Ain this way, the client can select a partner who offers favorableconditions for any element such as the price other than the tradingdate, even if several bidders offer the same paying-in date, or theclient can select a partner who may concede in the price or the articledelivery date even if the trading date is slightly late. The list screenXA corresponds to a browsing screen.

As appreciated from the foregoing description, the following advantagesare provided according to the first embodiment.

(1) With the employment of the time auction in which a client offers atrading due date condition such that bidders compete the trading duedate for an article or a buyer, the client can find a trading partnerwho satisfies requirements of the client in accordance with his personalcircumstances with respect to the trading due date such as an articledelivery date, a payment date, or the like.

(2) Since the time slide system is employed, the client can determine asa trading partner a bidder who offers the most favorable trading datefor the client. In addition, since the four types of time slide systemsare provided, the client can select an appropriate method of sliding thetime axis with respect to the due date in accordance with the client'scircumstances, thereby permitting the client to find a trading partnerwho offers a favorable trading date for the client.

(3) Since the price slide setting type is employed, the client can finda trading partner who satisfies the client's requirements in view of acombination of a period and a price. For example, it is possible to buyand sell an article (book, music CD, or the like), which becomes lesspopular and experiences a smaller value over time from the release day,at a price appropriate for a particular period. Also, when an enterpriseuses the price slide setting type for collecting advanced orders for anew product, the enterprise can readily distribute the orders whichwould otherwise concentrate on the release day, and can be provided withtotalized data on the result of bids and the result of an analysis onthe data to predict the future sales of the product. The prediction inturn helps review a production plan.

(4) Since the first embodiment permits a bidder to offer conditions, itis possible to narrow down bidders, when they complete, to a tradingpartner favorable for the client based on secondary elements such as theprice other than the trading due date. Also, a bidder is provided withan opportunity to offer conditions with which a higher priority may begiven to him, so that the bidder can acquire a wanted article or buyerwith a higher possibility.

Next, the definitions of the following terms used in the firstembodiment will be explained.

(1) “Trading Due Date” is meant to have a large concept including a dateon which a transaction is actually made such as a payment date, anarticle delivery date and so on, not limited to a date on which atrading contract is concluded.

(2) “Due Date” of the trading due date is meant to be a concept whichincludes a time point identified in temporal units such as years,months, weeks, days, hours, minutes and seconds, or a period which as arange of time.

Second Embodiment

A second embodiment which embodies the present invention willhereinafter be described with reference to FIGS. 15 through 23. In thefirst embodiment, an auction is conducted such that bidders compete withthe time, more specifically, a trading due date, whereas in the secondembodiment, an auction is conducted with an element other than the pricesuch as position, distance and time. In the second embodiment, the timeis not the trading due date but a required period of time. The requiredperiod of time may be, for example, a waiting time for a taxi to arrive.

A position auction is provided with a business auction for hiring acarrier such as a taxi which provides paid transportation services. Forexample, taxi companies may register themselves in this position auctionas users to efficiently receive provision of customers through theposition auction. Potential customers may also register themselves asusers to use the position auction.

Next, the position auction will be explained in a specific manner.

An auction management system (intermediary management server system) 20comprises a server 21, a display device 70, and an input device 71comprised of a keyboard, a mouse and so on. The server 21 is connectedto three databases 22, 23, 24. The server 21 is connected to theInternet N and further connected to terminals 30 of third parties forcommunications therewith through the Internet N. For example, personalcomputers in a plurality of taxi companies (hereinafter simply calledthe “personal computer”) 72 are connected to the Internet N so that theycan communicate with the server 21. For example, it is only taxicompanies (including owner driver taxis) which have previouslyregistered as users that are allowed to receive a customer provisionservice from the server 21. The customer terminals 30 connected to theInternet N can be communicated with the server 21. The customerterminals 30 may be a portable telephone 74 having the ability of makingcommunications through the Internet (for example those supporting thei-mode) other than the personal computers 73. A transceiver 75 isconnected to each of the personal computers 72 in the taxi companies, sothat it can radio communicate with a transceiver 77 equipped in each oftaxis 76 which belong to the company.

As illustrated in FIG. 17A, each of taxis 76 is equipped with a GPS(Global Positioning System) 78 which measures a position utilizing radiowaves of GPS satellites, so that the taxi 76 exactly measures a currentposition thereof through the GPS 78, and transmits the positioninformation from the transceiver 77 in the taxi 76 to the transceiver 75in the taxi company. Accordingly, the personal computer 72 exactlyperceives current positions of all taxis 76 belonging to the taxicompany. Also, as illustrated in FIG. 17B, the portable telephone 74held by a customer contains a GPS 79 so that it supports the positioningcapabilities. Therefore, a current position of the customer who carriesthe portable telephone 74 is sequentially measured, as required, by theGPS 79 contained in the portable telephone 74.

The server 21 of the auction intermediary company stores a variety ofprograms for auctions in a memory. An auction program is included inthese programs. This program informs respective taxi companies of acurrent position of a customer through the Internet N to conduct anauction in which the taxi companies intend to knock the customer down.The respective taxi companies participate in the auction while offeringposition information on taxis of their companies. The server 21 in turnidentifies the taxi which is positioned closest to the customer, as anacceptable bid condition based on the taxi position information, suchthat the customer determines this taxi as a successful bidder.

The personal computer 72 of the taxi company keeps track of currentpositions and current situations of the respective taxis 76 belonging tothe company based on the information from the respective taxis 76. Thecurrent situation refers to a situation of the taxi (in a mission, onthe move to a customer, during washing, lack of gasoline, during supplyof gasoline, and so on), a situation of a driver (taking a break, atmeal, and so on), a traffic situation (under construction, traffic jam,and so on). Any factor which causes a delay in an arrival time at acustomer even if the taxi is positioned near the customer is taken intoaccount in addition to the position (distance). Situation informationmay be fetched into the personal computer 72 by entering informationacquired through a radio communication by a manager of each taxi companyor digitally converting analog data received by the transceiver 75. Itis preferred however that the situation information should be able to betransmitted automatically to the personal computer 72 without burdeningthe driver. For example, the taxi 76 may be equipped with a variety ofsensors to detect predetermined situations, such that resultingsituation data is sequentially transmitted automatically to the personalcomputer 72 by a program or the like. Such an automatic situationdetecting method may rely on a variety of sensors, for example, agasoline amount detecting sensor for detecting a lack of gasoline; ataxi meter operation detecting sensor or a seat sensor for confirming ordetecting whether or not a passenger (customer) is present; and so on.Also, driver schedule management data is stored and matched with thetime provided by a timing function to determine, using a program,whether the driver is in a break time or a working time. Further, atraffic situation may be kept track of based on traffic jam informationand construction information provided by a transport managementorganization detected by traffic amount investigation devices installedalong roads.

FIG. 16 illustrates the functional configuration of the auctionmanagement system 20. The auction management system 20 comprises acommunication unit 81, a control unit 82, a position bid computing unit83, and a successful bid narrow-down computing unit 84. Thecommunication unit 81, control unit 82, position bid computing unit 83and successful bid narrow-down computing unit 84 are implemented by theserver 21. The communication unit 81 operates in accordance with apredetermined communication protocol (HTTP). An article management DB 23comprises a bid condition storage unit 85 which is comprised of aposition bid data storage unit 85A and a narrow-down data storage unit85B. The control unit 82 and the respective computing units 83, 84 areused for computing control for identifying a successful bidder in aposition auction, and a variety of data stored in the respective storageunits 85A, 85B are used for the computing.

An auction home page (HP) (site) resides in the server 21 in theintermediary company. A user (customer) displays the auction HPillustrated in FIG. 18 on a screen through the network N using a browserapplication from a terminal 30 for viewing the auction HP. The auctionHP in the second embodiment differs from the time auction HP in thefirst embodiment only in that the element “time” with which bidderscompete is replaced with “position”. A variety of screens such as theuser registration screen P illustrated in FIG. 4, the articleregistration screen Q illustrated in FIG. 5, and so on are likewiselinked to the auction HP. The server 21 stores in its hard disk, screendata for the variety of screens HP, P, Q, F, G and so on, a program foruse in displaying the screens and so on (for example, an HTMLdescription program), a program for use in computing involved in theauction, and so on.

As illustrated in FIG. 18, the auction HP is similarly provided with alarge number of selection buttons 51 classified into respective articlesand services for auction, and a large number of selection buttons 52classified into respective articles for counter-auction. A person whowants to participate in a bid (bidder) selects a selection button 51 or52 of a desired article classification. It should be noted that FIG. 18illustrates only a portion of article and service classifications. Theauction HP is also provided with a user registration button 53 and anarticle registration button 54. Selection of the button 53 or 54 resultsin the registration screen P (FIG. 4) or the registration screen Q (FIG.5) displayed on the terminal 30, and data entered from the screen P or Qis transmitted to the server 21 to proceed with user registration orarticle/service registration. An article also includes informationprovision. The position auction also provides a business positionauction (counter-auction) in which registered are dealers who provide acarrier such as a taxi which provides paid transportation services. Forexample, taxi companies may register themselves in this position auctionas users to efficiently receive provision of customers through theposition auction. While the taxi is given as an example in the secondembodiment, the present invention may be applied to any mobile object(vehicle or the like) such as a collection/delivery car which isdispatched to a customer or a predetermined place near the customer forproviding a service.

Since the auction HP has a “taxi” button 88, a customer may select thisbutton. Then, the customer enters required items on a taxi allocationscreen F illustrated in FIG. 19 which appears subsequent to the auctionbutton HP in response to the selection of the taxi button 88.Specifically, the screen F is provided with a GPS button 91 forspecifying a place at which the customer wants to take a taxi; atelephone number entry field F1, and a character entry field F2. Thescreen F is also provided with entry fields F3 to F6 for enteringcustomer feature communication, desired take time (within how manyminutes), number of passengers, and destination; a rank button 92 forspecifying a taxi rank (large, middle, small, rate rank, and so on); andan ID number entry field F7. Here, the GPS button 91 on the screen F maybe previously corresponded with the GPS 79 when using a portabletelephone 74 which supports the GPS, so that GPS position data can beregistered only by manipulating the button 91. As an alternative methodof identifying a position, it is possible to enter a telephone number ofthe customer's residence, building or the like. The server 21 isconnected to a system which identifies the address from the telephonenumber (telephone number search service company) so that the positioncan be identified provided that the telephone number is known. Thecharacter entry field F2 is filled with character information such asthe address, place name, readily perceivable rendez-vous place, or thelike. The feature communication entry field F3 is filled withidentifiable features of the customer himself. It should be noted thatthe taxi allocation screen F corresponds to a request screen.

After entering these required items, the customer selects a transmissionbutton 93 to transmit the customer information data to the server 21through the Internet N as bid request information. The server 21launches an auction program based on the customer information and widelypromotes taxi companies to participate in the position auction throughthe personal computers 72.

The personal computers 72 in the taxi companies are operative at alltimes, and upon receipt of information on a new auction, notifies anoperator (personal computer manager) to that effect through sound,display or the like. In this event, the server 21 provides an auctionparticipation screen G as illustrated in FIG. 20.

The auction participation screen G illustrated in FIG. 20 is providedwith display fields G1 to G5 for offering customer information such asthe position of a customer (a place at which the customer wants to takea taxi); the number of passengers; a specified rank of taxi;destination; the time at which the customer wants to take a taxi; and soon. The auction participation screen G is also provided with a mapdisplay field G6 which displays a map around the place at which thecustomer is present (map information). The position at which thecustomer is present (the place at which the customer wants to take ataxi) is indicated on the map (a black circle on the map in FIG. 20),such that the position at which the customer is present can be visuallyconfirmed in a specific manner on the map. The screen G is also providedwith entry fields G7, G8 for entering “taxi position” and “situation”.For participating in the auction, there is a time limit in order not tohave kept the customer waiting for a taxi to the utmost, so that adisplay field G9 is also provided for showing a remaining time. Forparticipating in the auction, each taxi company should have enteredrequired data in the entry fields G7, G8 within a time limit and selecta participation button 94. It should be noted that the auctionparticipation screen G corresponds to a bid screen.

The personal computer 72 of each taxi company keeps track of thepositions and situations of all the taxis 76 belonging to the company,and identifies an appropriate taxi 76 that can arrive at the customer inthe soonest time from these data and the place at which the customer ispresent (or his taxi taking place). Then, the operator of the personalcomputer 72 enters the position and situation of the identified taxi inthe entry fields G7, G8 and participates in the bid in the name of thetaxi, such that the taxi is determined as a successful bidder. Thesituation may describe, for example, “the taxi can directly go to theplace”; “it takes three minutes to supply the taxi with gasoline at ABCgasoline station”; “the driver is taking a break. The taxi can start infive minutes”; “the taxi is transporting a passenger(s)”; and so on. Forexample, situation data which evaluate this kind of situation may betransmitted to the server 21, so that the server 21 identifies a taxiwhich can arrive soonest at the customer based on the position of thetaxi and the situation data, and forces the identified taxi to bid offthe customer. Of course, each of taxi companies may be fully responsiblefor the determination of the situation such that the taxi companydetermines not to participate in the auction if the time limit isexceeded before the taxi arrives at the customer due to bad situations,and forces an appropriate one of taxis which can participate in theauction to do so. In this event, since the taxi company is responsiblefor the determination of the situation, a penalty may be awarded to thetaxi company if the allocated taxi has kept the customer waiting for thetaxi. This system provides the position auction in which bidders purelycompete only with the position.

Alternatively, the server 21 may fully determine a taxi situation toidentify a taxi which can arrive soonest at the customer. As arelatively feasible implementation, a manager of each taxi company mayenter pertinent ones of previously determined situation items in theentry field G8 as character information to notify the server 21 of thespecific situations. This implementation, however, requires man powerand is inefficient, so that it is desirable from a viewpoint ofefficiency that the personal computer 72 determines the situation basedon situation information (car situation information, driver situationinformation, traffic situation information) which can be acquired fromrespective taxis 76 and a variety of facilities. In this case, it ispossible to convert this kind of situation into a distance, to add thedistance for compensation to the actual position, and to participate inthe auction with the compensated position. It should be noted that thesituation information corresponds to time varying factor information.

The server 21 uses information (bid information) received from thepersonal computers 72 in the respective taxi companies (or mobileinformation terminals equipped in owner driver taxis such as mobiles,portable telephones), and performs predetermined processing on theinformation to identify a taxi 76 which can arrive in the soonest at aplace specified by the customer. The server 21 stores rating system dataof the respective taxi companies, and therefore automatically identifiesa taxi which will collect the lowest rate, and determines the thusidentified taxi as a successful bidder if some taxis offer asubstantially identical required time within a predetermined allowablerange.

Next explained is a method of identifying a taxi that can arrive in thesoonest time at a customer.

The server 21 calculates the distance between a taxi position and acustomer position on a map based on data on the two positions. Forexample, as illustrated in FIG. 21A, when a total of four taxis 76, Z1,Z2, Z3, Z4 participate in a bid for a customer who is waiting for a taxi76 at a Y point, the server 21 calculates the distances a, b, c, dbetween the respective taxis Z1, Z2, Z3, Z4 and the customer. In thisevent, while direct distances may be used, this embodiment usesdistances on the map for calculating more exact distances (It should benoted however that in FIG. 21 the distances are schematicallyrepresented by linear lines). In a pure position auction, the server 21compares these distances and determines the taxi at the shortestdistance from the customer as a successful bidder for the customer.

For taking into account situation information other than the position,the server 21 calculates estimated required times of the respectivetaxis Z1, Z2, Z3, Z4 in consideration of sequentially acquiredconstruction information and traffic jam information based on trafficinformation such as one-way roads and data from a traffic investigationorganization, in addition to the distance data which are simplydetermined from the positions. Also, the server 21 converts situationdata comprised of character information, numerical value data and so oninto a required time, and reflects the converted time to the previouslycalculated required time to derive an estimated required time.

FIG. 21A shows a method of identifying an appropriate taxi for acustomer in view of the distance between the current position of thetaxi and the customer position, whereas FIG. 21B shows a like method inview of the distance between an intermediate position of a taxi on ascheduled transition route and a customer. This is called the“on-the-move position auction.” The on-the-move position auction will bedescribed later.

The server 21 determines a taxi 76 that offers the soonest estimatedrequired time out of a plurality of taxis 76 participating in the bid asa successful bidder for the customer. Upon determination of the taxi 76as the successful bidder, the server 21 notifies the personal computer72 of the taxi company to which the winning taxi 76 belongs (or aportable telephone or the like, if an owner driver taxi was determinedas a successful bidder) of the fact that the taxi 76 was determined as asuccessful bidder, and of other required items such as features (signs)of the customer and so on through a communication via the Internet N orthe like. The taxi company, upon receipt of the notification of thesuccessful bid, informs the pertinent taxi 76 to that effect, causingthe taxi 76 to urgently go to the place specified by the customer.

Next, a procedure flow of the position auction will be explained belowwith reference to FIG. 22. It should be first noted that the illustratedprocedure flow does not necessarily show a processing procedure of theserver 21 but shows a procedure (flow) of the entire position auctionincluding communications between taxi companies and an intermediarycompany.

In S510, it is determined whether or not a request is made from acustomer. If there is no request from a customer, the server 21 waitsuntil a request is made from a customer. It should be noted that aprocedure in S510 where a request screen is displayed on terminals ofpotential customers and the server 21 receives information on thecustomer correspond to a request procedure.

In Step S520, the server 21 confirms where the customer is present.

In Step S530, the server 21 delivers the customer information throughthe Internet N.

In Step S540, a bidder participates in the position auction. It shouldbe noted that a procedure of displaying a bid screen on the terminal ofthe customer in S530, and a procedure of receiving bid information frombidders, which participate in the position auction, at the server 21 inS540 correspond to a bid procedure. Also, procedure from S540 to S560corresponds to a bid acceptance procedure.

In S550, it is determined whether or not a predetermined time hasexpired. In other words, it is determined whether or not there is noremaining time until the deadline for the participation in the positionauction.

In S560, the server 21 determines a taxi which offers the positionnearest from the customer. A current taxi position (upon participatingin the bid) is employed as position data, and the server 21 determines ataxi positioned at the shortest distance from the customer as a winningtaxi. Alternatively, if situation data is taken into account, the server21 determines a taxi which offers the soonest estimated required timefor a movement from the current position to the customer position as asuccessful bidder for the customer in consideration of the situation inaddition to the position.

In S570, the server 21 notifies the winning taxi to that effect.Specifically, the server 21 notifies the personal computer 72 in thetaxi company to which the winning taxi 76 belongs of the fact that itstaxi 76 was determined as a successful bidder. The taxi 76, upon receiptof the notification of the successful bid, urgently goes to a placespecified by the customer based on the customer position information andso on fetched from the personal computer 72. In this way, the customercan call the taxi 76 in the soonest time.

In Step S580, the customer is notified of information on the taxi.Specifically, since the customer does not know which taxi will come totake him, the customer is notified of information which allows thecustomer to confirm the taxi (the taxi company, the color of the taxi,and so on).

In the following, the on-the-move position auction will be explained.

If a taxi can catch a customer midway to a destination, or if acollection/delivery car can collect extra parcels on a scheduledcollection/delivery route, customers or parcels can be efficientlyacquired. Also, from the customer side, it is possible to take a taxisooner or to have the collection/delivery car collect or deliver aparcel sooner. For purposes of realizing such convenience, it is theon-the-move position auction that is provided for bidding off a customerwho is going to take a vehicle (a taxi or the like) from the nearestposition in the midway of a moving route of the vehicle or for biddingoff a vehicle which is moving on a road closest to a customer. In thisauction, a customer only needs to specify a place (taxi taking position)and a time at which a customer wants to use a taxi such that a taxi isallocated to him at the specified place and time, so that the taxi maybe far away from the customer at the time of the auction.

While a variety of programs stored by the server 21 in the memory forthe on-the-move position auction are basically similar to those used inthe position auction, a screen G (FIG. 20) additionally includes anentry field for entering information for identifying a moving route onwhich a vehicle of interest is moving, and an entry field for enteringinformation as to at which time the vehicle will pass the moving route(for example, data on the position at a certain time) in addition to theentry fields provided for the position auction. The server 21 relies ona similar technique to that used for the position auction to identifywhich taxi will pass the road closest to a place specified by a customerat a time specified by the customer from the moving route data andmoving time data, and determines a taxi (or a collection/delivery car)which will pass the road closest to the specified place as a successfulbidder for the customer. Conversely, if a customer is a client, thecustomer will select a taxi (or a collection/delivery car) which passesthe closest road as a successful bidder. It should be noted herein thatthe moving route data and the moving time data also constitute converteddata.

More specifically, as illustrated in FIG. 21B, when three taxis 76, Z1,Z2, Z3 move along moving routes shown in the figure, respectively, theserver 21 calculates places (positions) passed by the respective taxis76 on the move at a time t, and determines a taxi 76 which passes theplace nearest from a Y point, at which a customer is present at the timet, as a successful bidder for the customer. Conversely, the customerdetermines a taxi 76 which passes nearest from him at the time t as asuccessful bidder. In the example illustrated in FIG. 21B, the taxi Z1which is positioned closest to the customer (at a position indicated bya dotted line in FIG. 21B) at the time t will bid off the customer(however, without considering the situation). Likewise, in this case, apure position auction may be conducted to determine a successful biddersimply from the position alone, or an estimated required time may becalculated in view of a determination on the situation such as a taxisituation, a traffic situation and so on as is the case in this example.

Next, a procedure flow of the on-the-move position auction will beexplained below with reference to FIG. 23. It should be noted that theprocedure flow does not necessarily show a processing procedure of theserver 21 but shows a procedure (flow) of the entire position auctionincluding communications between taxi companies and an intermediarycompany.

In S610, it is determined whether or not a request is made from acustomer. If there is no request from a customer, the server 21 waitsuntil a request is made from a customer. It should be noted that aprocedure in S610 where a request screen is displayed on terminals ofpotential customers and the server 21 receives information on thecustomers correspond to a request procedure.

In Step S620, the server 21 confirms the location of the customer.

In Step S630, the server 21 delivers the customer information throughthe Internet N.

In Step S640, a bidder participates in the position auction. It shouldbe noted that a procedure of delivering customer information to displaya bid screen on terminals of potential bidders in S630, and a procedureof receiving bid information from bidders, which participate in theposition auction, at the server 21 in S640 correspond to a bidprocedure. Also, a procedure from S640 to S660 corresponds to a bidacceptance procedure.

In S650, it is determined whether or not a predetermined time hasexpired. In other words, it is determined whether or not there is noremaining time until the deadline for the participation in the positionauction.

In S660, the server 21 determines a taxi which offers the positionnearest from the customer. In this event, the position of each taxi at ataxi taking time t, estimated from the moving route, is employed asposition data, and the server 21 determines a taxi positioned at theshortest distance from the customer as a winning taxi. Alternatively, ifsituation data is taken into account, the server 21 determines a taxiwhich offers the soonest estimated required time for a movement from thecurrent position to the customer position as a successful bidder for thecustomer in consideration of the situation in addition to the position.

In S670, the server 21 notifies the winning taxi to that effect.Specifically, the server 21 notifies the personal computer 72 in thetaxi company to which the winning taxi 76 belongs of the fact that itstaxi 76 was determined as a successful bidder. The taxi 76, upon receiptof the notification of the successful bid, urgently goes to a placespecified by the customer based on the customer position information andso on fetched from the personal computer 72. In this way, the customercan call the taxi 76 in the soonest time.

In S680, the customer is notified of information on the taxi.Specifically, since the customer does not know which taxi will come totake him, the customer is notified of information which allows thecustomer to confirm the taxi (the taxi company, the color of the taxi,and so on).

As appreciated from the foregoing description, the following advantagesare provided according to the second embodiment.

(5) A customer, when taking a taxi, can request for a taxi which cancome to catch him the soonest. On the other hand, a taxi company canefficiently allocate a taxi which is positioned closest to the customer.

(6) In the on-the-move position auction, when a customer is positionedin the midway of a moving route of a vehicle of interest such as a taxi,a collection/delivery car or the like, the vehicle can catch thecustomer in the middle of its movement, thereby making it possible toefficiently acquire the customer. The customer does not either have towait for a long time.

Third Embodiment

A third embodiment which embodies the present invention will hereinafterbe described with reference to FIGS. 4, 15 through 17, 19 through 21,and 24 through 31. The third embodiment differs from the foregoingembodiments in that an auction is conducted such that bidders competewith the position as an element.

An auction system for conducting a position auction is basically similarin configuration to the system illustrated in FIG. 15. The positionauction refers to an auction system in which positional requirementsoffered by a client are transmitted to terminals of third partiesthrough a network to widely promote bids, and then a bid is conductedwith the position based on applied bid information to determine a bidderwho offers the position that most satisfies the requirements of theclient as a successful bidder. The client's requirements includerequirements offered by the client himself, and requirements previouslyprovided by a bid intermediary dealer, taken for granted from thecontents of a request from the client (a purpose of the request).

The position auction is a bid for a position at which both partiesacting as mutual trading partners, such as a buyer and a seller, areintroduced, and may be conducted for any item such as articles, servicesand so on. A position auction is provided with a business auction forhiring a carrier such as a taxi which provides paid transportationservices, and a collection/delivery car which comes to take a parcel andso on. For example, taxi companies may register themselves in thisposition auction as users to efficiently receive provision of customersthrough the position auction.

Next, the position auction will be explained in a specific manner. FIG.15 illustrates a position auction system in which either a customer or ataxi company selects a trading partner who most satisfies apredetermined positional condition through a network (the Internet inthis embodiment).

As illustrated in FIG. 15, an auction management system (intermediarymanagement server system) 20 comprises a server 21, a display device 70,and an input device 71 comprised of a keyboard, a mouse and so on. Theserver 21 is connected to three databases 22, 23, 24. The server 21 isconnected to the Internet N, and further connected to terminals 30 ofthird parties for communications therewith through the Internet N. Forexample, personal computers in a plurality of taxi companies(hereinafter simply called the “personal computer”) 72 are connected tothe Internet N so that they can communicate with the server 21. Forexample, it is only taxi companies (including owner driver taxis) whichhave previously registered as users that are allowed to receive acustomer provision service from the server 21.

The customer terminals 30 connected to the Internet N can becommunicated with the server 21. The customer terminals 30 may be aportable telephone 74 having the ability of making communicationsthrough the Internet other than the personal computers 73. A transceiver75 is connected to each of the personal computers 72 in the taxicompanies, so that it can radio communicate with a transceiver 77equipped in each of taxis 76 which belong to the company.

A transceiver equipped in the taxi 76, and the portable telephone 74 aresubstantially similar in configuration to those illustrated in FIGS.17A, 17B, respectively. As illustrated in FIG. 17A, each of taxis 76 isequipped with a GPS (Global Positioning System) 78 which measures aposition utilizing radio waves (signals) transmitted form a plurality ofsatellites, so that the taxi 76 exactly measures a current positionthereof through the GPS 78, and transmits the position information fromthe transceiver 77 in the taxi 76 to the transceiver 75 in the taxicompany. Accordingly, the personal computer 72 of the taxi companyexactly perceives current positions of all taxis 76 belonging to thetaxi company based on the position information output from the GPS 78.Also, as illustrated in FIG. 17B, the portable telephone 74 held by acustomer contains a GPS 79 so that it supports the positioningcapabilities. Therefore, a current position of the customer who carriesthe portable telephone 74 is sequentially measured, as required, by theGPS 79 contained in the portable telephone 74.

The server 21 illustrated in FIG. 15 stores a variety of programs forauctions in a memory. An auction program is included in these programs.This program informs respective taxi companies of position informationof a customer through the Internet N to conduct an auction in which thetaxi companies try to bid off the customer. The respective taxicompanies participate in the auction while offering position informationon taxis of their companies. The server 21 in turn identifies the taxi76 which is positioned closest to the customer, as an acceptable bidcondition based on the taxi position information, and determines thistaxi as a successful bidder.

The personal computer 72 of the taxi company keeps track of currentpositions and current situations of the respective taxis 76 belonging tothe company based on the information from the respective taxis 76. Thecurrent situation refers to a situation of the taxi (in a mission,enroute, during washing, when lacking gasoline, when supplied withgasoline, and so on), a situation of a driver (taking a break, at meal,and so on), a traffic situation (under construction, traffic jam,accident and so on). Any factor which causes a delay in an arrival timeat a customer even if the taxis is located near the customer is takeninto account in addition to a current situation.

Condition information such as a situation of each car, a situation of adriver, and so on, and road information such as a road situation may befetched into the personal computer 72 by entering information acquiredthrough radio communications by a manager of each taxi company ordigitally converting analog data received by the transceiver 75. Itpreferred however that the situation information should be able to betransmitted automatically to the personal computer 72 without burdeningthe driver. For example, a constitution is employed in which the taxi 76may be equipped with a variety of sensors to detect predeterminedsituations, such that resulting situation data is sequentiallytransmitted automatically to the personal computer 72 utilizing aprogram or the like based on detected values from the sensors. In thisembodiment, converted information is comprised of the conditioninformation and the road information.

Such an automatic situation detecting method for automatically detectingthe condition information such as a situation of a car, a situation of adriver, and so on, and the road information may rely on a variety ofsensors, for example, a gasoline amount detecting sensor for detecting alack of gasoline; a taxi meter operation detecting sensor or a seatsensor for confirming or detecting whether or not a passenger (customer)is present; and so on. Also, driver schedule management data is storedand matched with the time provided by a timing function to determineusing a program whether the driver is in a break time or a working time.Further, a traffic situation may be known based on traffic jaminformation and construction information provided by a transportmanagement organization detected by traffic amount investigation devicesinstalled along roads. Position and situation data from the respectivetaxis 76 are fetched into the personal computer 72 in the taxi companyas digital data. The road information from the transport managementorganization is managed by the server 21.

The auction management system for use in the position auction issubstantially similar in configuration to that illustrated in FIG. 16.As illustrated in FIG. 16, the auction management system 20 comprises acommunication unit 81, a control unit 82, a position bid computing unit83, and a successful bid narrow-down computing unit 84. Thecommunication unit 81, control unit 82, position bid computing unit 83and successful bid narrow-down computing unit 84 are implemented by theserver 21. The communication unit 81 operates in accordance with apredetermined communication protocol (HTTP). An article management DB 23within three databases 22 to 24 comprises a bid condition storage unit85 which is comprised of a position bid data storage unit 85A and anarrow-down data storage unit 85B. The control unit 82 and therespective computing units 83, 84 are used for computing control foridentifying a successful bidder in a position auction, and a variety ofdata stored in the respective storage units 85A, 85B are used for thecomputing.

An auction home page (HP) illustrated in FIG. 24 resides in the server21. A user (customer) displays the auction HP illustrated in FIG. 24 ona screen through the network N using a browser application from aterminal 30 for viewing the auction HP. A variety of screens such as auser registration screen P similar to that illustrated in theaforementioned FIG. 4, a taxi allocation screen F similar to thatillustrated in FIG. 19, the auction participation screen G illustratedin FIG. 20, and an article/service registration screen H illustrated inFIG. 25, and so on are linked to the auction HP. The server 21 stores inits hard disk, screen data for the variety of screens P, F, G, H, and soon, a program for use in displaying the screens and so on (for example,an HTML description program), a program for use in computing processinginvolved in the auction, and so on.

The position auction HP is provided with a large number of selectionbuttons 100, 101, 102 classified into respective articles and servicespotentially traded in the auction. A person who wants to participate ina bid (bidder) selects a selection button 100, 101 or 102 of a desiredarticle/service classification. The position auction HP is also providedwith a “user registration” button 103 and a “request registration”button 104, such that selection of the button 103 or 104 results in theregistration screen P (FIG. 4) or a registration screen H (FIG. 25)displayed on the terminal 30, and data entered from the screen P or H istransmitted to the server 21 to proceed with user registration orarticle/service registration.

The user registration screen P illustrated in FIG. 4 is provided withoptions for selecting a private or a business registration in additionto the options P1 and the variety of entry fields P2. For example, aclient who requests for a taxi 76 may select an option for the privateregistration, while a taxi company may select an option for the businessregistration, before entering other items for registration. The userregistration screen P is also provided with an entry field for enteringa credit card number or the like.

When the user has entered all required items in associated fields on theuser registration screen P and selects an OK button 55, the just entereduser registration data D1 comprised of these items, the selected optionP1, and information entered in the entry field P2 is transmitted to theserver 21 through the network N and stored in the customer management DB22 of the three databases 22 to 24. Upon confirming that the user haspaid a predetermined commission (registration fee), the server 21transmits an authentication number (ID and password) to the terminal ofthe registered user. The registered user uses the authentication numberfor utilizing the position auction.

As illustrated in FIG. 25, the article/service registration screen H isprovided with a variety of entry fields H1 to H8 such as article/serviceclassifications, article/service name, desired price, quality, quantity,contents of service, custody/provision place (position), article/serviceinformation, and so on. When the user has entered all required items inassociated fields on the article/service registration screen H displayedon the terminal 30 and selects a transmission button 105,article/service registration data D8 as bid information comprised of theinformation entered in the variety of entry fields H1 to H8 istransmitted to the server 21 through the network N and stored in the bidmanagement DB 24. For example, in the case of articles such as gasoline,second hand articles and food, an auction may be conducted using bidinformation that is the article/service registration data D8 which hasbeen previously registered upon acceptance of an advanced bid. In thisevent, the article/service registration screen H corresponds to a bidscreen.

The position auction HP illustrated in FIG. 24 is provided with a“direct trade” button 106 and an “information trade” button 107. Thedirect trade button 106 is used for selecting an article or a service ora buyer of an article or a service directly through an auction. Forexample, the direct trade button 106 is used for directly bidding off aservice by a taxi or a collection/delivery car (taxi allocation service,collection/delivery service, or the like), an article, or the like. Theinformation trade button 107 in turn is used when a user wants toacquire useful information on an article or a service or its provider (amanufacturer, a service company or the like), and is selected when theuser accepts only the provision of information from third parties.

A person who wants to participate in the position auction selects one ofthe direct trade button 106 and the information trade button 107, andthen selects one of the selection buttons 100 to 102 associated with anarticle or a service (for example, allocation of a taxi,collection/delivery service, or the like) for which the person wants toparticipate in the auction. The selection button 102 is effective onlyfor the “information trade”. The position auction HP is also providedwith options 108 for a client to select a normal auction in which theclient bids off an article or a service or a counter-auction in whichthe client bids off a buyer of an article or a service. For example, acustomer who wants the allocation of a taxi or a collection/delivery carmay select the “auction”, while a taxi company or a collection/deliveryservice company may select the “counter-auction” for obtaining acustomer. Finally, an “established” button 130 is selected after allselections required on the position auction HP have been made.

A mobile body which is allocated to a customer or to a predeterminedplace near the customer is not limited to such vehicles as a taxi and acollection/delivery car, but may be any mobile body such as ahelicopter, an airplane and so on.

In the following, the position auction will be explained for an examplein which the button “taxi” 101 is selected on the position auction HPspecifically about the screens and processing procedures provided forthe position auction. Assume, for example, that a client (customer)selects the button “taxi” 101 to display the taxi allocation screen Fillustrated in FIG. 19 on the screen of the terminal 30, and entersrequired items on the screen F. Specifically, the screen F is providedwith a GPS button 91 for specifying a position at which the customertakes a taxi, a telephone number entry field F1, and a character entryfield F2. The screen F is also provided with entry fields F3 to F6 forentering customer feature communication, desired take time (within howmany minutes), number of passengers, and destination; a rank button 92for specifying a taxi rank (large, middle, small, rate rank, and so on);and an ID number entry field F7. It should be noted that the taxiallocation screen F corresponds to a request screen.

The screen F is also provided with a setting frame 109 as illustrated inFIG. 26 for specifying conditions on a range and position for a positionat which the customer wants a taxi to come to pick up him. The settingframe 109 is provided with a “no range” button 110 and a “with range”button 111. The customer may select the “with range” button 111 when hewants to limit to those taxis which lie within a desired range from ataxi taking position. Beneath the respective buttons 110, 111, options112 for selecting “nearest” and “furthest” are provided in the settingframe 109. When the customer selects “nearest” in the options 112, ataxi positioned nearest from a taxi taking position is bidden off,whereas when the customer selects “furthest,” a taxi positioned furthestaway from the taxi taking position is bidden off. A shorter waiting timeis preferred when a customer requests for the allocation of a taxi, sothat the selection of “nearest” is taken for granted. Therefore, if apositional condition is spontaneously limited from the characteristicsof a particular service, the options 112 may be eliminated. Here, thetaxi taking position specified by the customer corresponds to a desiredvalue.

When the customer uses, for example, a portable telephone 74 supportingthe GPS in order to indicate his position or a position at which hewants to take a taxi, the GPS button 91 on the screen F may bepreviously corresponded with the GPS, in which case GPS position data isregistered (entered) and transmitted to the server 21 only bymanipulating the button 91. As an alternative method of identifying aposition, it is possible to enter a telephone number of the customer'sresidence, building or the like in the telephone number entry field F1.For example, the server 21 is connected to a system which identifies theaddress from the telephone number (telephone number search servicecompany) so that the position can be identified provided that thetelephone number is known. The character entry field F2 is filled withcharacter information such as the address, place name, readilyperceivable rendez-vous place, or the like. The feature communicationentry field F3 is filled with identifiable features of the customer.

Here, one of five types of possible bidding systems (bid conditions(successful bid priority rules)) illustrated in FIGS. 27A through 27E isdetermined depending on the presence or absence of a specified range andpositional conditions which have been set in accordance withrequirements of the customer. These five types of bidding systems willbe explained below with reference to FIGS. 27A through 27E. It should benoted that a wide variety of bidding systems are provided forconvenience of clients, so that some bidding systems may not be suitablefor a request for the allocation of a taxi although they are alsoexplained in the example in which a client requests for the allocationof a taxi.

First, FIG. 27A illustrates the case where the client has set “no range”and “nearest” on the setting frame 109. This case corresponds to apriority rule which preferentially determines a party (bidder) whooffers a nearest possible position to a taxi taking position specifiedby the client (customer) as a successful bidder. In this event, frombidders A, B, C, the bidder C who has offered the nearest position isdetermined as a successful bidder. FIG. 27B in turn illustrates the casewhere the client has set “no range” and “furthest” on the setting frame109. This case corresponds to a priority rule which preferentiallydetermines a party (bidder) who offers a furthest possible position to aspecified taxi taking position as a successful bidder. In this case,from bidders A, B, C, the bidder C who has offered the furthest positionis determined as a successful bidder.

FIG. 27C illustrates the case where the client has set “with range” and“nearest” on the setting frame 109. This case corresponds to a priorityrule which preferentially determines a party who offers a nearestpossible position within a certain range specified by a customer. Inthis event, from bidders A, B, C, the bidder C who has offered thenearest position within a predetermined range is determined as asuccessful bidder. FIG. 27D in turn illustrates the case where theclient has set “with range” and “furthest” on the setting frame 109.This case corresponds to a priority rule which preferentially determinesa party who offers a furthest possible position within a certain rangespecified by a client. In this event, from bidders A, B, C, the bidder Cwho has offered the furthest position within a predetermined range isdetermined as a successful bidder. FIG. 27E illustrates a priority rulewhich preferentially determines the party who offers the nearestposition from a specified taxi taking position as a successful bidderirrespective of whether it is from the near side or from the far sidefrom the taxi taking position. In this event, from bidders A, B, C, D,the bidder D who has offered the nearest position is determined as asuccessful bidder.

It should be noted that in the bidding systems illustrated in FIGS. 27Athrough 27E, if a plurality of bidders fall under successful bidders(the bidder C or D shown in the respective figures), the bidders arenarrowed down based on predetermined rules, later described. In thisembodiment, assume that the customer selects the “no range” button 110on the setting frame 109 illustrated in FIG. 26, and then selects“nearest” from the options 112 so that the customer selects the taxi 76that is nearest to a position at which the customer wants to board ataxi.

After entering required items on the taxi allocation screen F, as theclient selects a transmission button 93 to transmit the entered items,bid information data D9 as bid request information comprised of theentered required items as data contents is transmitted to the server 21through the Internet N. Alternatively, the input device 71 provided forthe auction management system 20 may be used to manually enter a varietyof conditions for the allocation of a taxi which may be received fromthe telephone 80 (see FIG. 15). The bid information data D9 received bythe server 21 is stored in the article management DB 23. Specifically,reference position data such as a taxi taking position specified by thecustomer, positional condition data (range, positional conditions, andso on), and so on within the bid information data D9 are stored in theposition bid data storage unit 85A.

In addition, since a plurality of competing taxis satisfy most thepositional conditions so that a customer cannot narrow down to one taxias the case may be, the narrow-down data storage unit 85B previouslystores narrow-down condition data which allows the customer to finallydetermine as a successful bidder a taxi which is favorable to thecustomer in terms of services and so on. In this embodiment, when aplurality of taxis are at the same distance from a taxi taking positionof a customer within a predetermined allowable range (this range may beset by the customer) so that these taxis compete for the customer, theyare narrowed down to one by adding a narrow-down condition. The server21 stores a variety of data related to rating systems and services ofrespective taxi companies in the database 22, and reads the narrow-downcondition from the database 22 when a plurality of taxis are at the samedistance from a taxi taking position within the allowable range, toautomatically identify a taxi which provides good services, offers alower rate and satisfies the narrow-down condition, and determines thistaxi as a successful bidder.

The server 21 executes the auction program at all times when it isoperating to widely promote taxi companies to participate in theposition auction by offering requirements of a customer on the personalcomputers 72 in the respective taxi companies through the internet Nbased on the bid information data D9 received from the customer. On theother hand, the personal computer 72 in each of the taxi companies isoperating at all times, and upon receipt of new auction information,notifies the operator (personal computer manager) to that effect throughsound, display or the like. In this event, displayed on the personalcomputer 72 is the auction participation screen G similar to thatillustrated in FIG. 20, provided from the server 21. It should be notedthat this auction participation screen G corresponds to a bid screen.

The auction participation screen G illustrated in FIG. 20 is providedwith display fields G1 to G5 for offering customer information such asthe position of a customer (a place at which the customer wants to takea taxi) as a desired value (a reference position); the number ofpassengers; a specified rank of taxi; destination; the time at which thecustomer wants to take a taxi; and so on. The auction participationscreen G is also provided with a map display field G6 which displays amap around the place at which the customer is present. The position atwhich the customer is present (the place at which the customer wants totake a taxi) is indicated on the map (a black circle on the map in FIG.20), such that the position at which the customer is present can bevisually confirmed in a specific manner on the map. The screen G is alsoprovided with entry fields G7, G8 for entering “taxi position” and“situation.” For participating in the auction, there is a time limit inorder not to have kept the customer waiting for a taxi to the utmost, sothat a time display field G9 is also provided for showing a remainingtime. For participating in the auction, each taxi company (auctionparticipant) should have entered required data in the entry fields G7,G8 within a time limit and select a participation button 94. Byselecting the participation button 94, bid data D10 as bid informationcomprised of information entered on this screen G is transmitted to theserver 21. The bid data D10 is stored in the database 24.

The personal computer 72 of each taxi company keeps track of thepositions and situations of all the taxis 76 belonging to the company,and identifies an appropriate taxi 76 which can arrive at the customerin the soonest time from these data and the place at which the customeris present (taxi taking place). Then, the operator of the personalcomputer 72 enters the position and situation of the extracted taxi 76in the entry fields G7, G8 and participates in the bid in the name ofthe taxi 76, such that the taxi 76 is determined as a successful bidder.The situation refers to a situation of the taxi (in a mission, on themove to a customer, during washing, lack of gasoline, during supply ofgasoline, and so on), a situation of a driver (taking a break, at meal,and so on), and so on. If a taxi will delay in arriving at a customereven if the taxis is located near the customer, the taxi should notifythe situation which accounts for the delay. While the situation may beentered by typing on a keyboard, each of a variety of situations haspreviously been assigned a code for faster auction processing in thisembodiment, so that the taxi company enters code data in the entry fieldG8. The code data indicates the type of situation, and a required timetaken therefor, for example, in minutes.

In this embodiment, situation data is automatically captured into thepersonal computer 72 without burdening a driver or a manager of the taxicompany. The personal computer 72 in each taxi company capturessituation data, after converted into a digital form, through thetransceivers 75, 77 from each of taxis 76 belonging to the taxi companyvia radio communications. The situation data detected by a variety ofsensors mounted in the taxi 76 is automatically transmitted to thepersonal computer 72 in sequence together with position data making useof a program or the like. The personal computer 72 identifies eligibletaxis 76 from the position and situation data captured from therespective taxis 76, and the manager views a list in which candidatetaxis are enumerated, for example, in the ascending order of eligibilityon the screen of the personal computer 72 to determine a taxi 76 whichparticipates in the position auction. In this event, selection of a taxion the list may cause the position and situation data associatedtherewith to be automatically entered in the respective entry fields G7,G8.

Alternatively, it is also possible to automatically register an eligibletaxi 76 identified by the personal computer 72 in the entry fields F7,F8. In this event, the entry field F8 displays character informationindicative of a situation corresponding to a code, wherein the code datamay be transmitted to the server 21 such that the manager can readilyconfirm the situation. Of course, the situation data received from therespective taxis 76 via a radio communication may be manually entered bythe manager of each taxi company into the personal computer 72. Further,the situation data may be presented to the server 21 in characterinformation (text data or the like).

Also, in this embodiment, the situation data requested to the taxicompanies is limited to a taxi situation and a driver situation whichonly the taxi companies can know, while a road situation (underconstruction, traffic jam, accident, and so on) is traced by the server21. The server 21 sequentially receives road information from thetransport management organization for management purposes to keep trackof the traffic amount and construction information on a route from theposition of each taxi to a taxi taking position of the customer withinthe bid information.

Also, the server 21 converts the situation data into a required time foreliminating the situation, and further converts the required time foreliminating the situation to a distance to derive a correction distancewhich is reflected to the actual position of the taxi to correct theposition of the taxi. In other words, a delay due to a certain situationis converted into a correction distance, and the actual position of thetaxi is shifted away by this correction distance. The resulting positionis re-calculated as the distance which is offered when the taxiparticipates in the auction. The server 21 calculates the distance onthe map between the position of each taxi and a taxi taking positionbased on the position data of the taxi in consideration of thesituation.

Then, the server 21 identifies the taxi 76 which is positioned nearestfrom the taxi taking position of the customer using the bid datareceived from the personal computers 72 in the respective taxi companies(or portable information terminals (for example, mobiles, portabletelephones, and so on) of owner-driver taxis) in consideration of theposition and situation included in the bid data. It should be noted thatdata entered in the entry fields G7, G8 on the participation screen Gcorrespond to position conversion information which is converted to aposition (element).

Next explained is a method of identifying the taxi 76 which ispositioned nearest from a taxi taking position of a customer. The server21 calculates a point-to-point distance on a map based on respectivedata of the position at which each taxi 76 is positioned (the positionafter taking into consideration the situation) and the position at whichthe customer wants to take a taxi. For example, as illustrated in FIG.21A, when a total of four taxis 76, Z1, Z2, Z3, Z4 participate in a bidfor a customer who is waiting for a taxi 76 at a Y point, the server 21calculates the distances a, b, c, d between the respective taxis Z1, Z2,Z3, Z4 and the customer. In this event, while direct distances may beused, this embodiment uses distances on the map for calculating moreexact distances. It should be noted however that in FIG. 21A, thedistances are schematically represented by linear lines. In the positionauction, the server 21 compares these distances and determines the taxiat the shortest distance from the customer as a successful bidder forthe customer. When a plurality of taxis are at the same distance from ataxi taking position of a customer within a predetermined allowablerange so that these taxis compete for the customer, the server 21narrows down to one taxi under a narrow-down condition in considerationof rating systems and services of respective taxi companies toautomatically identify as a successful bidder a taxi which provides goodservices, offers a lower rate, and satisfies the narrow-down condition,and determine this taxi as a successful bidder.

Upon determination of the taxi 76 which is positioned nearest from theposition at which the customer wants to take a taxi as the successfulbidder, the server 21 notifies the personal computer 72 of the taxicompany, to which the winning taxi 76 belongs, of the fact that the taxi76 was determined as a successful bidder, and of other required itemssuch as features (signs) of the customer and so on through acommunication via the Internet N or the like. The taxi company, uponreceipt of the notification of the successful bid, informs the pertinenttaxi 76 to that effect, causing the taxi 76 to urgently go to the placespecified by the customer. The customer, in turn, is notified throughthe Internet N of the company name, scheduled arrival time and so on ofthe taxi which is directing urgently to the specified place.

Alternatively, a taxi company may act as a client which requests forcollection of customers in a position auction to conduct a normalauction in which customers make a bid. Specifically, a taxi company,which has been registered as a user, selects a customer who is presentnearest from a present position of a free taxi 76 through the positionauction. The taxi company may also select a customer who takes a taxi tothe furthest destination through the position auction. In this event, adealer request procedure screen is provided corresponding to the screenF of FIG. 19, wherein the taxi company selects “furthest” as apositional condition.

As a result of an auction, information on a single successful bidder isbasically transmitted to the client. However, if the client wishes, aplurality of narrowed down candidates may be presented, as illustratedin a list screen XB of FIG. 29. Specifically, the server 21 createsinformation provided by bidders, as it is, into a list, or creates apriority list by narrowing down successful bidder candidates of higherpriority levels, for example, into a limited number specified by theclient, based on information offered by bidders, and transmits thecreated list to the terminal 30 of the client. Then, the list XBillustrated in FIG. 29 is displayed on the terminal 30 of the client.The screen XB is provided with a list XB1, an entry field XB2 forselecting a successful bidder, and a decision button 113.

The list XB1 indicates a priority number, a code number, and a position,reference information (information offered by bidders such as a ratingsystem (price), and offered services (supplementary items and so on)).The client reviews the positions and reference information of respectivetaxis in the list XB1 on the screen XB to determine a taxi favorable forhim as a successful bidder, enters, for example, the priority number (orthe code number) of the winning taxi in the entry field XB2, and selectsthe decision button 113. In response, the server 21 notifies the clientand the successful bidder of the successful bid. When the list XB1 canbe viewed on the terminal 30 of the client, the client can select a taxiwhich is favorable for him in terms of other reference conditions suchas the rating system, services and so on, other than the position, if aplurality of taxis offer the same positions within an allowable range,or can select a taxi which is favorable for him in terms of the ratingsystem and services even if the taxi is slightly further away from thecustomer than other taxis.

Next, the flow of the position auction will be explained with referenceto FIG. 31. It should be noted that the procedure flow does notnecessarily show a processing procedure of the server 21 but shows aprocedure (flow) of the entire position auction including communicationsbetween taxi companies and an intermediary company.

First in step (hereinafter simply denoted as “S”) 701, a taxi takingposition of a customer is entered.

In S702, a positional condition for the taxi taking position of thecustomer is entered. It should be noted that the procedure in S701 andS702 for displaying a request screen on the terminal of the customer,and receiving data entered on the screen at the server 21 corresponds toa request procedure.

In S703, it is determined whether or not a customer has made a request.If so, the procedure flow continues to S704.

In S704, a position auction is started. Specifically, data such aslocation data of the customer is delivered to the respective terminals30.

In S705, the position of each taxi is entered.

In S706, condition information is entered. Specifically, entered in S706are a car situation such as in a mission, during washing, lack ofgasoline, during supply of gasoline, and so on, and a situation of adriver such as taking a break, at meal, and so on. It should be notedthat the procedure of starting the auction to display the request screenon the terminal of the customer in S704 and receiving the data enteredin S705 and S706 at the server 21 corresponds to a bid procedure.

In S707, it is determined whether or not there are applications to theposition auction. In other words, it is determined whether or not thereare bids from bidders. When no bid is applied, the server 21 waits forbids. On the other hand, when there are bids, the procedure flowcontinues to S708. A procedure from S707 to S715 corresponds to a bidacceptance procedure.

In S708, road information is entered. Specifically, road informationfrom the transport management organization (information on traffic jam,under construction, accident and so on) is entered. Alternatively, theroad information in S708 may be entered from the personal computer 72 inthe taxi company as the request procedure.

In S709, the position correction processing is executed. Specifically, arequired time for eliminating each situation is converted into adistance based on situation data to correct the position of each taxi.

In S710, the bid processing is executed with the position. Specifically,a priority order is determined for bidders as trading partners inaccordance with the taxi taking position condition entered in S702 (thepriority rules in FIG. 27).

In S711, it is determined whether or not a limited time has expired.When within the limited time, the procedure flow returns to S707 torepeat the processing from S707 to S710 to execute the bid processingeach time a new bidder applies, until the limited time expires. At theexpiration of the limited time, the procedure flow continues to S712.

In S712, it is determined whether or not a bid-off self selection isset. The procedure flow continues to S713 when the bid-off selfselection is not set, and to S714 when the bid-off self selection isset.

In S713, narrow-down processing is executed. Specifically, a bidder whohas offered the position which most meets requirements of the user(client) is bidden off as a trading partner.

On the other hand, if it is determined in Step S712 that the bid-offself selection is set, the list screen XB illustrated in FIG. 29 isdisplayed in S714 for enumerating bid information of a predeterminednumber of bidders in a list form. The user can view the list screen XBby selecting a screen display after entering a password on the screen ofthe terminal 30. The list screen XB enumerates candidates in a priorityorder in terms of the position (displayed as the code number), so thatthe user can determine a trading partner while referencing otherinformation offered by the bidders. As the user determines a tradingpartner, the user enters the associated code number in the successfulbidder selection entry field XB2 and then selects the decision button113. The information on the successful bidder selected by the user istransmitted to the server 21 through the Internet N.

In S715, it is determined whether or not a successful bidder has beendetermined. This list screen XB is continuously displayed (S714) untilthe user determines a successful bidder, and the procedure flowcontinues to step S716 when a successful bidder is determined.

In S716, the server 21 notifies both the user and the successful bidderof the establishment of the trade.

Explained next is a position auction with a mobile body (taxi) on themove.

If a taxi can catch a customer in the midway to a destination, or if acollection/delivery car can collect extra parcels on a scheduledcollection/delivery route, customers or parcels can be more efficientlyacquired. Also, from the customer side, it is possible to take a taxi ina sooner time. For purposes of realizing such convenience, it is theon-the-move position auction that is provided for bidding off a vehicleon the move which is running nearest from a customer (FIG. 21B) or forbidding off a customer who takes a taxi at the nearest location from aroute along which the taxi is moving (FIG. 29). In this on-the-moveposition auction, a customer only needs to specify a place (taxi takingposition) and a time at which a customer wants to use a taxi such that ataxi is allocated to him at the specified place and time, while the taximay be far away from the customer at the time of the auction.

Now, explanation is given of the position auction of the formillustrated in FIG. 29 for bidding off a customer who takes a taxi 76 atthe nearest position from a route along which the taxi is moving. Whilea variety of programs stored in the memory for the server 21 to conductthe on-the-move auction are basically similar to those used in theposition auction, a customer allocation screen M illustrated in FIG. 30is displayed in the on-the-move auction. Assume herein that customershave already reserved for a bid for allocation of a taxi.

The customer allocation screen M is provided for display fields M1 to M5for offering customer information such as a position of a customer (aplace at which the customer wants to take a taxi) as a desired value (areference position); the number of passengers; a specified rank of taxi;destination; the time at which the customer wants to take a taxi; and soon. The customer allocation screen M is also provided with a map displayfield M6 which displays a map around the place at which the customer ispresent (map information). The position at which the customer is present(the place at which the customer wants to take a taxi) is indicated onthe map (a black circle on the map in FIG. 30), such that the details onthe position at which the customer is present can be visually confirmedon the map. The screen M is also provided with entry fields M7, M8 forentering “taxi position” and “situation”. For participating in theauction, there is a time limit in order not to have kept the customerwaiting for a taxi to the utmost, so that a time display field M9 isalso provided for showing a remaining time. It should be noted that thecustomer allocation screen M corresponds to a request screen.

Additionally, the screen M is also provided with an entry field M10 forentering information for identifying a route on which a taxi is moving,and an entry field M11 for entering information as to at which time thetaxi passes along the route (for example, a position data at a certaintime). A taxi company (auction participant) which participates in theauction enters required data on the screen M within the time limit, andselects a participation button 114. In response, bid data Db as bidrequest information comprised of the contents of data entered on thescreen M is transmitted to the server 21.

The server 21 relies on a similar technique to that used for theposition auction to identify which taxi 76 will pass a road closest to aplace specified by a customer at a time specified by the customer fromthe moving route data and moving time data which have been convertedfrom taxi taking position data of the customer and the moving route ofthe taxi 76. When a taxi company bids off a customer, a taxi (or acollection/delivery car) bids off a customer who is present nearest fromthe taxi after a predetermined time. On the other hand, if a customerbids off a taxi, the customer bids off a taxi which passes nearest fromthe customer after a predetermined time. It should be noted thatinformation for identifying a moving route on which a taxi is moving,and information as to at which time a taxi passes the moving route alsoconstitute converted information.

More specifically, when a taxi 76 bids off a customer, the followingmethod is used for identifying the customer. As illustrated in FIG. 29,assume that customers are located at four points Z5, Z6, Z7, Z8, and ataxi 76 passes along a path illustrated in FIG. 29. In this event, thetaxi 76 bids off a customer who is present at a position nearest from aY point at time t. The value of the time t can be arbitrarily setirrespective of on the taxi company side or the customer side.

On the other hand, when a customer bids off a taxi 76, the followingsequence is taken. As illustrated in FIG. 21B, when three taxis 76 (Z1,Z2, Z3) move along respective routes shown in the figure, respectively,the server 21 calculates places (positions indicated by broken lines inthe figure) passed by the respective taxis 76 on the move at a time t,and the customer bids off a taxi 76 which passes the place nearest froma Y point at which a customer is present at the time t. In the exampleillustrated in FIG. 29 or 21B, one of the customer and the taxi 76 whichis present nearest from the other at the time t bids off the other.Here, the taxi position at time t is the position after a correction inconsideration of the situation and so on of the taxi 76. Therefore, inthis case, the bid is conducted with the corrected taxi position byconverting a traffic situation, taxi situation and so on to a distance.A pure position auction may be conducted instead to determine asuccessful bidder simply by comparing the position of the taxi with theposition of the customer.

Basically, a procedure flow of the on-the-move position auction issubstantially similar to the flow of the position auction illustrated inFIG. 31. However, the on-the-move position auction differs in that,because the taxi position at the time t is employed, the taxi positionat the time t is calculated based on information for identifying amoving route along which the taxi is moving, and information as to atwhich time the taxi passes a certain point on the moving route toconduct the auction with the calculated position. Specifically, when ataxi bids off a customer, advanced bids are collected before theposition auction is started in S704, and the position of a taxi,condition information, information for identifying a moving route alongwhich the taxi is moving, information as to at which time the taxipasses a certain point (for example, a start point) on the moving route,and so on are entered to find the position of a taxi at the time t basedon the respective data. Then, in steps subsequent thereto, a bid isconducted based on information of a customer who acts as a bidder todetermine a successful bidder.

On the other hand, when a customer bids off a taxi, the information on amoving route along which a taxi is moving, information as to at whichtime the taxi passes the moving route, and so on are also entered, forexample, in S706 in FIG. 31. Then, the position of taxi, aftercorrection, at the time t estimated from the moving route is employed asposition data. Then, in the bid processing in S710, a priority order isdetermined for a plurality of taxis 76 who have participated in the bidin an order from the taxi which passes the road nearest from thecustomer. Thus, the customer bids off the taxi 76 that is nearest to thecorrected position, in consideration of the situation in addition to theposition, to the position of the customer.

As appreciated from the foregoing, the following advantages are providedaccording to the third embodiment.

(7) With the employment of the position auction in which a client offersa trading position condition such that bidders compete the tradingposition for a trading partner, the client can find a trading partnerwho satisfies requirements of the client in accordance with his personalcircumstances with respect to the trading position.

(8) With the employment of the on-the-move position auction in which aclient offers a trading position condition such that bidders compete thetrading position for a trading partner in consideration of a movingdistance of a mobile body (taxi or the like), the client can find atrading partner who satisfies requirements of the client in accordancewith his personal circumstances with respect to the trading positioneven if the mobile body is on the move.

Fourth Embodiment

Next, a fourth embodiment will be explained with reference to FIGS. 24and 32 through 36. The fourth embodiment differs from the foregoingembodiments in that “information” is traded in a position auction.

The position auction according to the fourth embodiment is adapted toconduct a bid for information with a position indicated in theinformation. Here, an explanation is given of an example, illustrated inFIG. 24, in which a “school of fish” button 102 is selected on theposition auction HP. A position auction for a school of fish isconducted to bid off information on the position of a school of fishwhich is nearest from the position of a fishing boat. Specifically, afishing boat may provide fishermen and fishing boats with information onsigns of fish which is not a target of the fishing boat itself but maybe intended, for example, by other fishing boats, other than fish whichis captured by the fishing boat. In this event, fishing boats and so onwhich expect such information generally want information on signs offish nearest from them.

More specifically, a ship which has information on signs of fishprovides the information to a server 21 in an intermediary companythrough the Internet N. For example, fishermen and fishing boats may usethe position auction to look for any useful information on the fishingfrom nearby ships. Then, the server 21 widely provides terminals 30 ofthird parties with such an outline of information that let the thirdparties understand to which the information is related. A third partywhich views the outline makes dealing procedures to buy the informationthrough the terminal 30.

For example, as a client (requester) selects the “school of fish” button102, a fish school information requesting screen FA illustrated in FIG.32 is displayed. Specifically, the screen FA is provided with a GPSbutton 99 for specifying the location of a client (for example, afishing boat), a telephone number entry field FA1, a character entryfield FA2, and so on. The screen FA is also provided with an entry fieldFA3 for entering notifying the characteristics of the fishing boat, anentry field FA4 for entering the kind of fish to be caught, an ID numberentry field FA5, and so on. Further, though not shown, the screen FA isprovided with a setting frame 109 illustrated in FIG. 26 for setting thepresence or absence of a range, and selecting nearest or furthest fromthe location of the fishing boat as well. Then, as the client selects atransmission button 115, bid information data D11 as bid requestinformation entered on the screen FA is transmitted to the server 21,and stored in the article management DB 23. It should be noted that thefish school information requesting screen FA corresponds to a requestscreen.

Upon receipt of new auction information, the server 21 notifies theterminals 30 of third parties (personal computers, portable telephonesand so on), which have been registered as users in the server 21, tothat effect through sound, display or the like. Then, for participatingin the position auction by providing information on the position of aschool of fish, an auction participation screen GA illustrated in FIG.33 is provided from the server 21 and displayed on the terminal 30. Itshould be noted that the auction participation screen GA corresponds toa bid screen.

The auction participation screen GA illustrated in FIG. 33 is providedwith a display field GA1 for providing a customer information such asthe position of a fishing boat, and a display field GA2 for displayingthe kind of fish desired by the client. The screen GA is also providedwith a chart display field GA3 which displays therein a chart around theposition at which the fishing boat is present. The position of thefishing boat is displayed on the chart, so that the details on theposition of the fishing boat can be visually confirmed on the chart. Thescreen GA is also provided with an entry field GA4 for entering“position of school of fish.” Then, as a participant enters requireddata in the entry field GA4 within a time limit indicated in a displayfield G5 and selects a participation button 116, causing fish schoolposition data D12 to be transmitted to the server 21 and stored in thebid management DB 24 as bid information.

Alternatively, an information registration screen NN illustrated in FIG.34 may be displayed by selecting an “information registration” button117 on the position auction HP in FIG. 24 to previously enterinformation on the position of a school of fish on the screen NN. Thescreen NN is provided with a display field N1 for displaying desiredinformation, a display field N2 for displaying an information fee, andso on. The screen NN is also provided with an information entry field N3and an ID number entry field N4. Such information providers should belimited to those who have registered as users in order to ensure thereliability of the information provided by them. As an informationprovider enters required items in the entry fields N3, N4 and selects atransmission button 118, information registration data D13 as bidinformation entered in the entry field N3 on the screen NN istransmitted to the server 21 and stored in the bid management DB 24. Theinformation provider uses an authentication number when utilizing theposition auction.

Then, the server 21 identifies information on the position of a schoolof fish which is situated nearest from a ship by using the informationreceived from the respective terminals 30 and performing predeterminedprocessing on the received information. Alternatively, instead of anormal auction in which a customer ship such as a fishing boat bids offinformation on the position of the nearest school of fish, acounter-auction may be conducted such that a fishing boat at theposition nearest from the position of a school of fish is provided withinformation on the position of the school of fish (which may include afishery right and so on).

Next, a procedure flow of the position auction will be explained withreference to FIG. 35. It should be noted that the procedure flow doesnot necessarily show a processing procedure of the server 21 but shows aprocedure (flow) of the entire position auction including communicationsbetween a fishing boat and an intermediary company.

First, in S801, the position of a fishing boat is entered.

In S802, a positional condition for the position of the fishing boat isentered. It should be noted that a procedure in S801, S802 wherein therequest screen is displayed on a terminal 30 of a client, and the server21 receives data entered on the screen, corresponds to a requestprocedure.

In S803, it is determined whether or not a customer has made a request.If a request has been made, the procedure flow continues to S804.

In S804, the position auction is started. Specifically, data such as thedata on the position of the fishing boat is delivered to respectiveterminals 30.

In S805, bidders (participants of the bid) enter information on theposition of a school of fish. It should be noted that a procedure ofstarting the auction and displaying the bid screen on the terminals 30of the bidders in S804, and receiving the entered data at the server 21in S805, corresponds to a bid procedure.

In S806, it is determined whether any application has been made to theposition auction. In other words, the presence or absence of a bid froma bidder is determined. If there is no bid, the server 21 waits forbids. If there is a bid, the procedure flow continues to S807. It shouldbe noted that a procedure executed from S806 to S812 corresponds to abid acceptance procedure.

In S807, bid processing is executed with the position. Specifically, incomparison with the positional condition (the priority rules in FIG. 27)for the position of the fishing boat entered in S802, a priority orderis determined for the bidders as trading partners.

In S808, it is determined whether or not a limited time has expired.When within the limited time, the procedure flow returns to S806 torepeat the processing in S807, S808 to execute the bid processing eachtime a new bidder applies, until the limited time expires. At theexpiration of the limited time, the procedure flow continues to S809.

In S809, it is determined whether or not a bid-off self selection isset. The procedure flow continues to S810 when the bid-off selfselection is not set, and to S811 when the bid-off self selection isset.

In S810, narrow-down processing is executed. For example, when aplurality of fish school position information compete, successfulbidders are narrowed down with reference to the kind of fish, density ofsigns of fish and price of the information.

On the other hand, if it is determined in S809 that the bid-off selfselection is set, a list screen similar to the list screen XBillustrated in FIG. 28 is displayed in S811 for enumerating bidinformation offered by a predetermined number of bidders in a list form.The user can view the list screen by selecting a screen display afterentering a password on the screen of the terminal 30. The list screenenumerates candidates in a priority order in terms of the position(displayed as the code number), so that the user can determine a tradingpartner while referencing other information offered by the bidders.

In S812, it is determined whether or not a successful bidder has beendetermined. The list screen XB is continuously displayed (S811) untilthe user determines a successful bidder, and the procedure flowcontinues to step S813 when a successful bidder is determined.

In S813, the server 21 notifies both the user and the successful bidderof the establishment of the trade. Consequently, the fishing boat canobtain information on the school of fish positioned at the shortestdistance from the fishing boat.

The position auction according to this embodiment is not limited to ataxi (allocation of a taxi or the like) and a school of fish, but may beextended to the articles and services assigned to the buttons 100 whichare selected on the position auction HP illustrated in FIG. 24.Specifically, a predetermined button 100 is selected on the positionauction HP to open an entry screen for a client to enter a position,desired information on the position, and so on. Then, from bidders whoparticipate in the auction, a trading partner which is nearest (orfurthest) from the position specified by a client, or information on thetrading partner may be selected through the position auction.

In this event, the auction is conducted in accordance with a procedureflow illustrated in FIG. 36. Specifically, in S901, the position of aclient is entered, and in S902, a positional condition desired by theclient is entered. Then, it is determined in S903 whether or not thereis a request from the client. If there is a request, the positionauction is started in S904. In S905, the position of a bidder isentered, and it is determined in S906 whether or not there is anapplication to a bid. If so, bid processing is executed with theposition in S907. Next, it is determined in S908 whether or not a timelimit expires. S906 and S907 are repeated if the time limit does notexpire in S908.

Then, it is determined in S909 whether or not a bid-off self selectionis set. When the bid-off self selection is not set, narrow-downprocessing is executed in S910 to enumerate bidders in a priority orderfrom the one who most satisfies the requirements of the client anddetermine a successful bidder as a trading partner. Conversely, if thebid-off self selection is set in S909, a list screen similar to that ofFIG. 28 is displayed in S911. Then, in S912, the client bid off a bidderwho satisfies the desired condition as a trading partner while viewingthe list screen. In S913, the server 21 notifies both the client and thesuccessful bidder of the establishment of the trade. Listed below areother specific examples for which a procedure flow illustrated in FIG.36 may be used.

A counter-auction may be conducted such that a collection/deliverydealer collects a load. Specifically, a client can select a load whichis nearest from the position of a collection/delivery worker, acollection/delivery car, collection/delivery ship, a collection/deliveryairplane, or the like, or information associated therewith through theposition auction.

A button may be selected from “toilette”, “gasoline”, “food”, and“antique object” on the position auction HP illustrated in FIG. 24 toselect a sales man, a sales place, a provider, a providing place, or thelike of a requested object (gasoline, agricultural product, toilette,ukiyoe, or the like) which is nearest from a place at which a person whopurchases or desires such requested objects is present, or a placespecified by the person, or information associated therewith through theposition auction. Alternatively, a counter-auction may be conducted suchthat the foregoing sales man, sales place, provider, providing place orthe like of the required objects enumerated above collects a person whopurchases or desires such requested objects. In other words, a clientcan select a person who purchases or desires the object of interestnearest from a sales man of the object or from a place at which aprovider of the object is present, or information on him through theposition auction.

By selecting the “service” button on the position auction HP illustratedin FIG. 24, it is possible to select a provider of a service or the like(right of using the service or the like) nearest from a place at which aperson who desires the service or the like is present, or a specifiedplace, or information on the service provider trough the positionauction. Alternatively, a counter-auction may be conducted such that aservice provider collects a person who desires a service of interest orthe like. In other words, a person who provides a service of interest orthe like may select a person who desires the service or the like nearestfrom him, or information on the person through the position auction.

By selecting one from the buttons “accommodation”, “restaurant”,“store”, and “service place” on the position auction HP, a person who islooking for such facilities may select the business office (right ofutilizing a service of interest or the like) located nearest from him,or information on the business office through the position auction.Alternatively, a counter-auction may be conducted such that a client canselect the customer who is present nearest from a hotel, a restaurant, astore, a service place, or the like, or information on the customerthrough the position auction.

By selecting one from the buttons “hospital”, “dentist”, “clinic”, and“beauty salon” on the position auction HP, a patient, an injured person,a customer, or the like who is looking for such facilities can selects ahospital, a dentist, an acupuncturist, a moxa-cauterizer, a massager, achiropractic clinic, a beauty salon, and so on (in other words, a rightof utilizing a service), located nearest from such a requester, orinformation on such facilities through the position auction.Alternatively, a counter-auction may be conducted such that a doctor, adentist, an acupuncturist, a moxa-cauterizer, a massager, a chiropractictherapist, a beauty culturist, or the like can select a patient, aperson who desires a service of interest, or the like and is presentnearest from him or her, or information on such person through theposition auction.

By selecting a button “satellite communication” on the position auctionHP, a client can select the space satellite which is located nearestfrom a satellite reception facility, a receiver, or the like, orinformation on the space satellite through the position auction.Alternatively, a counter-auction may be conducted such that a client canselects a satellite reception facility, a receiver, or the like locatednearest and available for receiving information (signal) transmittedfrom the space satellite, or information on the facility through theposition auction.

By selecting a button “investigation” on the position auction HP, aclient can select a space satellite, a helicopter, an investigation cat,an investigator, or the like which is located nearest from a place to beinvestigated, or information on such items through the position auction.Alternatively, a counter-auction may be conducted such that a client canselects the place to be investigated nearest from a space satellite, ahelicopter, an investigation car, an investigator, or the like, orinformation on the place through the position auction.

By selecting one from buttons “repair”, “snow-removing” and “volunteer”on the position auction HP, a client can select a person nearest from arequester who requests for repair, snow-removing, volunteer (helper), orthe like and who accepts such a request, or information on the personthrough the position auction. Alternatively, a counter-auction may beconducted such that a client can select the requester who is presentnearest from a repair car, a snow thrower, a Jack-of-all-trades, or thelike, or information on the requester through the position auction.

By selecting a button “real estate” on the position auction HP, a personwho desires to purchase an immovable can select the immovable locatednearest from a desired place, or information on the immovable throughthe position auction. In this event, if bidders are collected afteraccepting a request from a person who desires to purchase an immovable,it is possible to more effectively select a desired immovable.

By selecting one of buttons “guard” and “disaster prevention” on theposition auction HP, if an abnormal alarm is notified, or if a firedetector or a crime prevention system operates, or if a monitorperceives an abnormal situation, it is possible to select notificationto a guard company, a disaster prevention security company, a guard man,a crime prevention person, or the like nearest from the site, orderingof the guard or crime prevention, or information thereon through theposition auction.

By selecting a button “animal related items” on the position auction HP,an animal hospital, an animal hotel, or the like nearest from a place inwhich a pet or an animal is present, or information on such facility canbe selected through the position auction.

The position auction is not limited to selection of the person (tradingpartner) who is present nearest from a place at which a requester (forexample, a client) is located and accepts a request, or information onthe person by auction, but may be used to select a trading partner whois present at the position furthest from a place at which a requester islocated or from a specified position, or information on the tradingperson at auction. For example, it is possible to select theagricultural products or food (articles) which are stored furthest froma place suffering from radioactive or environmental pollution, orinformation on such products at auction by selecting the button“agricultural products” or “food” on the position auction HP illustratedin FIG. 24.

By selecting the button “taxi” on the position auction HP, a client suchas a taxi company can select the passenger who goes furthest, orinformation on the passenger through the position auction.

By selecting one from buttons “taxi”, “bus”, “train”, and “air linecompany” on the position auction HP, a client can select a taxi, a bus,a train, an airplane, or the like which takes the client to the mostremote place with a declared amount of money, or information on suchtransportation means through the position auction. It should be notedthat the conventional auction varies a unit value of a rate, whereas theposition auction according to this example differs from the conventionalauction in that a transportation distance is varied with a fixed unitvalue of the rate.

By selecting one of buttons “telephone company” and “communicationfacilities” on the position auction HP, a client can select a telephonecompany through which the client can place a call to the most remoteplace or a communication facility which can transmit to the most remoteplace for a declared amount of money, or information on such company orfacility through the position auction. This example also differs fromthe conventional auction in that a call or communication distance isvaried with a fixed unit value of the rate.

For selecting a person who accepts a request (trading partner) throughthe position auction of this embodiment, the position auction is notlimited to simply make a selection based on the presence at the positionfurthest or nearest from a requester (for example, a client). Forexample, it is also possible to select the trading partner who ispresent nearest from a location at which a client is present or aspecified position, or information on the trading partner within aspecified predetermined range. For example, when the client selects the“taxi” button on the position auction HP illustrated in FIG. 24 andspecifies a certain predetermined range, the client can select the taxiwhich is positioned nearest within the range, or information on the taxithrough the position auction.

When the position auction is conducted with a certain range specifiedwith respect to the position of a client, it is possible to select aperson (trading partner) who accepts a request and is present at a placefurthest within the specified range, without limiting to select a personwho accepts the request and is present at the place nearest within therange. For example, by selecting the “facility” button on the positionauction HP illustrated in FIG. 24, a requester can select a dealer whoinstalls a processing facility, a cemetery, a crematory, a factory, anatomic power plant, a dangerous article depository, or the like at thefurthest site within a determined range from a place specified by therequester, or information on the dealer through the position auction.

By selecting the “real estate” button on the position auction HP, it ispossible to select an immovable which is located at the place furthestwithin a determined range from a place specified by a requester, orinformation on the immovable through the position auction.

When a client selects a predetermined one from the buttons on theposition auction HP and specifies a certain range, the client can selectan immovable, a store, a hotel, a service place, a hospital, a facility,a plant, a parcel (load), crop (agricultural products or the like), andrecovered article which is found nearest within the range through theposition auction. Alternatively, it is also possible to select theforegoing immovable, facility and article which are found furthestwithin the range, or information on them through the position auction.

By selecting one of buttons “car”, “ship”, “air line company” and“transportation” on the position auction HP, it is possible to select acar, a ship, an airplane, transportation equipment, or the like which ispositioned at the place nearest or furthest within a specified range,irrespective of a client, or information on them through the positionauction.

For conducting an on-the-move position auction based on the position ofa mobile body such as a taxi after moving by a predetermined distance,the mobile body is not limited to the taxi. For example, by selectingthe button “school of fish” on the position auction HP illustrated inFIG. 24, it is possible to select a fishery right or provision of itsinformation for the ship which is located nearest from a destination towhich a school of fish expected by a fish tracker is expected to movethrough the position auction.

The mobile body is not limited to the taxi and so on, but may include atransport vehicle for transporting wastes, excrement or the like. Forexample, by selecting the “transportation” button on the positionauction HP illustrated in FIG. 24, it is possible to select thetransported article loading or unloading place located nearest from ascheduled destination of a transportation car or a transporter on themove for transporting wastes, excrement or the like, or information onsuch a place through the position auction.

By selecting the button “collection/delivery” on the position auctionHP, it is possible to select the transported article loading orunloading place located nearest from an expected destination of acollection/delivery worker, a collection/delivery ship, acollection/delivery car, a collection/delivery airplane, or the like onthe move, or information on such a place through the position auction.

By selecting an “others” button on the position auction HP, it ispossible to select a buyer or a person who wants something, who ispresent at the place nearest from a destination to which a sales man ora provider on the move is scheduled to move, or information on such aperson through the position auction.

By selecting an “association” button on the position auction HP, it ispossible to select a person who desires association or a person whodesires a service who is present at the place nearest from a destinationto which a sociable person or a service provider on the move isscheduled to move, or information on such a person through the positionauction.

By selecting one of the buttons “accommodation”, “restaurant”, “store”,and “gasoline” on the position auction HP, it is possible to select thebusiness office which is located nearest from a destination to which aclient, on the move, looking for a hotel, a restaurant, a store, agasoline station, is scheduled to move, or information on the businessoffice through the position auction.

By selecting one of the buttons “gasoline”, “food” and “daily necessity”on the position auction HP, it is possible to select a place at which arequested article is provided, located at the place nearest from adestination to which a client on the move who is looking for an articlesuch as gasoline, food, thing of daily necessity, or the like isscheduled to move, or information on the place through the positionauction.

By selecting the button “hospital” on the position auction HP, it ispossible to select a hospital which is located at the place nearest froma destination to which an urgent patient, on the move, suffering from adisease or an injury is scheduled to move, or information on thehospital through the position auction.

By selecting the button “satellite communication” on the positionauction HP, it is possible to select, in a space satellite on the move,the satellite reception facility or a receiver which is located nearestand available for receiving information (signal) transmitted from aspace satellite located at a scheduled destination, or information onsuch a facility through the position auction.

By selecting the “guard” button on the position auction HP, it ispossible to select a guard man or a tracker who is present at the placenearest from a destination to which a person on the move requested to becaught or found is scheduled to move, or information on such a personthrough the position auction.

By selecting a “track” button on the position auction HP, it is possibleto select a space satellite, a helicopter, a tracking car, a tracker, orthe like which is located at a place nearest from a destination to whichan object (for example, a vehicle) on the move is scheduled to move, orinformation associated therewith through the position auction.

As appreciated from the foregoing, the following advantages can beprovided according to the fourth embodiment.

(9) With the employment of the position auction in which a client offersa trading positional condition to bid off information from a third partytrading partner, the client can obtain information which meets his ownrequirements in terms of a trading position in accordance with hiscircumstances.

Fifth Embodiment

Next, a fifth embodiment will be explained with reference to FIGS. 1, 4,13, 24, and 37 through 45. The fifth embodiment differs from theforegoing embodiments in that an auction is conducted such that bidderscompete with a numerical value as an element. The numerical value asconsidered for a trade of an article may include length, height, area,volume, bulk, weight, amount, and so on.

An auction system for conducting a numerical value auction is basicallysimilar in configuration to the system illustrated in FIG. 1. Thenumerical value auction refers to an auction system in which numericalvalue requirements offered by a client are transmitted to terminals ofthird parties through a network to widely promote bids, and then a bidis conducted with the numerical value based on applied bid informationto determine a bidder which offers the numerical value that mostsatisfies the requirements of the client as a successful bidder. Theclient's requirements include requirements offered by the clienthimself, and requirements previously provided by a bid intermediarydealer, taken for granted from the contents of a request from the client(a purpose of the request).

The numerical value auction is a bid for a numerical value at which bothparties acting as mutual trading partners, such as a buyer and a seller,are introduced, and may be conducted for any item such as articles,services and so on. A numerical value auction is provided with abusiness auction for requesting for a processing facility for processingwastes or the like as a paid service, and a collection/delivery carwhich comes to take a parcel and so on, as later described. For example,processing dealers and collection/delivery dealers may registerthemselves in this numerical value auction as users to efficientlyreceive provision of trading partners who most satisfy theirrequirements through the numerical value auction.

Next, the numerical value auction will be explained in a specificmanner. FIG. 1 illustrates a numerical value auction system in which oneof a client and a trading partner selects the other who most satisfies apredetermined numerical value condition through a network (the Internetin this embodiment).

As illustrated in FIG. 1, an auction management system (intermediarymanagement server system) 20 comprises a server 21 which is connected tothree databases 22, 23, 24. The server 21 is connected to the InternetN, and further connected to terminals 30 of third parties forcommunications therewith through the Internet N. The customer terminals30 connected to the Internet N can be communicated with the server 21.The customer terminals 30 may be a portable telephone 32 having theability of making communications through the Internet other than apersonal computer 31. The terminals 30 may be classified into thosepossessed and used by individuals and those for business use installedin respective companies or the like.

The server 21 illustrated in FIG. 1 stores a variety of programs for thenumerical value auction in a memory. An auction program is included inthese programs. This program informs information desired by a client tobidders through the internet, such that the bidders participate in theauction by providing information related to numerical values which theycan provide. Then, the server 21 extracts a bidder who most satisfiesrequirements of the client based on the information offered by thebidders, and bids off this bidder as a trading partner.

FIG. 37 illustrates the functional configuration of the auctionmanagement system 20. The auction management system 20 comprises acommunication unit 121, a control unit 122, a numerical value bidcomputing unit 123, and a successful bid narrow-down computing unit 124.The communication unit 121, control unit 122, numerical value bidcomputing unit 123 and successful bid narrow-down computing unit 124 areimplemented by the server 21. The communication unit 121 operates inaccordance with a predetermined communication protocol (HTTP). Amongthree databases 22 to 24, an article management DB 23 comprises a bidcondition storage unit 125 which is comprised of a numerical value biddata storage unit 125A and a narrow-down data storage unit 125B. Thecontrol unit 122 and the respective computing units 123, 124 are usedfor processing control for identifying a successful bidder in anumerical value auction, and a variety of data stored in the respectivestorage units 125A, 125B are used for the computing processing.

A numerical value auction home page substantially similar to the auctionhome page (HP) of FIG. 24 resides in the server 21. A user (client)displays the numerical value auction HP on a screen through the networkN using a browser application from a terminal 30 for viewing thenumerical value auction HP. A variety of screens such as the userregistration screen P similar to that illustrated in FIG. 4, anarticle/service registration screen HA illustrated in FIG. 39, a bidform selection screen I illustrated in FIG. 39, an auction participationscreen GB illustrated I in FIG. 40, and so on are linked to thenumerical value auction HP. Also, a numerical value dimension selectionscreen J illustrated in FIG. 38 and an information provision screen NAillustrated in FIG. 42, later described, are also linked to thenumerical value auction HP. The server 21 stores in its hard disk,screen data for the variety of screens P, HA, I, GB, J, NA and so on, aprogram for use in displaying the screens and so on (for example, anHTML description program), a program for use in computing processinginvolved in the numerical value auction, and so on.

As illustrated in FIG. 24, the numerical value auction HP is providedwith a large number of selection buttons 100 to 102 classified intorespective articles and services potentially traded in the auction. Aperson who wants to participate in a bid (a client or a bidder) selectsa selection button 100 to 102 of a desired article/serviceclassification. The numerical value auction HP is also provided with a“user registration” button 103 and a “request registration” button 104,such that selection of the button 103 or 104 results in the registrationscreen P (FIG. 4) or a registration screen HA (FIG. 39) displayed on theterminal 30, and data entered from the screen P or HA is transmitted tothe server 21 to proceed with user registration or article/serviceregistration.

As illustrated in FIG. 4, the user registration screen P is providedwith options P1 for selecting a seller or a buyer, and a variety ofentry fields P2 for entering address, name, telephone number, electronicmail address, sex, age, remarks, credit card number, and so on. Inaddition, the user registration screen P is provided with options forselecting for individual or for business, wherein, for example, a clientwho requests for a waste dealer or a collection/delivery dealer mayselect an option for the private registration, while a dealer or thelike may select an option for the business registration, before enteringother items for registration. When the user has entered all requireditems in associated fields on the user registration screen P and selectsan OK button 55, the just entered user registration data D1 comprised ofthese items, the selected option P1, and information entered in theentry field P2 is transmitted to the server 21 through the network N andstored in the customer management DB 22 of the three databases 22 to 24.Upon confirming that the user has paid a predetermined commission(registration fee), the server 21 transmits an authentication number (IDand password) to the terminal of the registered user. The registereduser uses the authentication number for utilizing the numerical valueauction.

As illustrated in FIG. 39, the article/service registration screen HA isprovided with a variety of entry fields HA1 to HA9 such asarticle/service classifications, article/service name, desired price,numerical value dimension, numerical value, quantity, contents ofservice, custody/provision place (position), article/serviceinformation, and so on. The numerical value dimension entry field HA4 isfilled with a dimension such as length, area, weight, amount or thelike. The numerical value entry field HA5 in turn is filled with aspecific value of a selected dimension. When the user has entered allrequired items in associated fields on the article/service registrationscreen HA displayed on the terminal 30 and selects a transmission button126, article/service registration data D14 as bid information comprisedof the information entered in the variety of entry fields HA1 to HA9 istransmitted to the server 21 through the network N and stored in the bidmanagement DB 24. For example, in the case of articles such as gasoline,second hand articles and food, an auction may be conducted using bidinformation that is the article/service registration data D14 which hasbeen previously registered upon acceptance of an advanced bid. In thisevent, the article/service registration screen HA corresponds to a bidscreen.

The numerical value auction HP illustrated in FIG. 24 is provided with a“direct trade” button 106 and an “information trade” button 107. Thedirect trade button 106 is used for selecting an article or a service ora buyer or a seller of an article or a service directly through anauction. For example, the direct trade button 106 is used for directlybidding off a service by a collection/delivery car (collection/deliveryservice, or the like), an article, or the like. The information tradebutton 107 in turn is used when a user wants to acquire usefulinformation on an article or a service or its provider (a manufacturer,a service company or the like), and is selected when the user acceptsonly the provision of information from third parties.

A person who wants to participate in the numerical value auction selectsone of the direct trade button 106 and the information trade button 107,and then selects one of the selection buttons 100 to 102 associated withan article or a service for which the person wants to participate in theauction. The numerical value auction HP is also provided with options108 for a client to select a normal auction in which the client bids offan article or a service or a counter-auction in which the client bidsoff a buyer of an article or a service. For example, a customer whowants the allocation a collection/delivery car or the like may selectthe “auction”, while a collection/delivery service company may selectthe “counter-auction” for ensuring the customer. Finally, the clientselects an “established” button 130 after he has selected a desiredauction form, trading manner, and an item to be traded, respectively.

In this embodiment, numerical values with which a bid is conducted mayinclude length, height, area, volume, bulk, weight, amount, and so on,specific examples of which will be described later. Upon selecting thefield of the article/service on the HP screen illustrated in FIG. 24 andthen selecting specific article or service on a screen at a lowerhierarchical level or the like, a numerical value dimension selectionscreen J illustrated in FIG. 38 is displayed. The numerical valuedimension selection screen J is provided with numerical value selectionbuttons 131 to 137 for “length”, “height”, “area”, “volume”, “bulk”,“weight” and “amount” and a decision button 138.

The auction program is created such that the user can select a suitablenumerical value in accordance with an article or a service which istraded by the user, and stored in the memory in the server 21. Theprogram is illustrated in a flow chart of FIG. 46, in which a numericalvalue selected by the user is competed at auction. As the user selects anumerical value on the numerical value dimension selection screen J, abid form selection screen I illustrated in FIG. 40 is displayed forselecting a bid form. It should be noted that the numerical valuedimension selection screen J and the bid form selection screen Icorrespond to a request screen.

As illustrated in FIG. 40, the bid form selection screen I is providedwith an article/service display field I1 and a numerical value dimensiondisplay field I2. The bid form selection screen I is also provided withoptions 13 for selecting a seller or a buyer, bid form options I4, areference value entry field I5, an approach direction options I6, arange entry fields I7, and a transmission button 139. The bid formoptions I4 includes an option for specifying that a smaller value isgiven a higher priority level, an option for specifying a greater valueis given a higher priority level, and an option for specifying a valuecloser to a specified reference value is given a higher priority level.The user may select one from these options.

The approach direction options I6 are provided for specifying from whichdirection a value should approach to a specified reference value, ifany, and include an option for specifying that the reference value isapproached from a smaller value direction, an option for specifying thatthe reference value is approached from a greater value direction, and anoption for specifying that the reference value is approached from bothdirections. The user may select one from these options. The range entryfields I7, which are provided for specifying a range, allow the user toselect only an upper limit or a lower limit or not to select a range.Bid information data D15 as bid request information comprised of theinformation selected in the respective options and entered in therespective fields I3 to I7 on the screen R is transmitted to the server21 and stored in the bid information management DB 24. The referencevalue corresponds to a desired value. The information entered in therespective entry fields I4 to I7 corresponds to desired information.

Upon receipt of new auction information from a client, the server 21transmits a notice to terminals 30 of third parties (bidders) to thateffect through sound, display or the like. Then, an auctionparticipation screen GB illustrated in FIG. 41 is provided from theserver 21 and displayed on the terminals 30 of the bidders. It should benoted that the auction participation screen GB corresponds to a bidscreen.

As illustrated in FIG. 41, the auction participation screen GB isprovided with display fields GB1 to GB6 for displaying article/service,numerical value dimension, form, reference value, approach method, andrange. The contents displayed in these display fields GB1 to GB6corresponds to the contents entered in the respective entry fields 13 to17 on the bid form setting screen I of FIG. 40. The screen GB is alsoprovided with a numerical value entry field GB7 for entering a numericalvalue which can be offered by a bidder. As a bidder has entered apredetermined numerical value in this entry field GB7 and selects atransmission button 140, bid data D16 as bid information comprised ofthe information entered on the screen GB is transmitted to the server21, and stored in the bid information management DB 24.

As illustrated in FIGS. 44A through 44E, five types of bids areavailable for the numerical value auction. Specifically, since anumerical value representing any of length, area, weight, amount and soon can be placed on a coordinate axis, a reference value is set on thecoordinate axis such that rules are defined as to how a bid isconducted, i.e., whether a closest possible value is preferentiallyselected or whether a furthest possible value is preferentiallyselected.

FIGS. 44A through 44E are diagrams for explaining the types of thenumerical value auction. For representing the dimension of a numericalvalue in accordance with the numerical value in a numerical value form,numerical values may be classified into concepts of incremental valuesand concepts of decremental values. For example, far, large, wide, long,heavy, many and so on are concepts of incremental values, while near,small, narrow, short, light, few and so on are concepts of decrementalvalues. The bid form refers to the rules as to whether the largest oneof offered numerical values and so on is determined as a successful bid;or whether the smallest one is determined as a successful bid; orwhether a value coincident with or closest to a reference valuespecified by a customer is determined as a successful bid. There are thefollowing five types of bids.

Here, one of five types of possible bidding systems (bid conditions(successful bid priority rules)) illustrated in FIGS. 44A through 44E isdetermined depending on the presence or absence of a specified range andpositional conditions which have been set in accordance withrequirements of the customer. These five types of bidding systems willbe explained below with reference to FIGS. 44A through 44E. First, FIG.44A shows a priority rule which preferentially determines a person whooffers the smallest numerical value within a predetermined range as asuccessful bidder. In this event, from bidders A, B and C, the bidder Cwho has offered the closest numerical value to a reference value withina predetermined range is determined as a successful bidder. FIG. 44Bshows a priority rule which preferentially determines a person whooffers the furthest numerical value within a predetermined range as asuccessful bidder. In this event, from bidders A, B and C, the bidder Cwho has offered the furthest numerical value is determined as asuccessful bidder.

FIG. 44C shows a priority rule which preferentially determines a personwho offers the value closest to a specified numerical value (referencevalue) from the greater value side. In this event, from bidders A, B andC, the bidder C who has offered the closest numerical value to thereference value is determined as a successful bidder. FIG. 44D shows apriority rule which preferentially determines a person who offers thevalue furthest away from a specified numerical value (reference value)from the smaller value side. In this event, from bidders A, B and C, thebidder C who has offered the furthest numerical value away from thereference value is determined as a successful bidder. FIG. 44E shows apriority rule which preferentially determines a person who offers aclosest possible numerical value any way irrespective of whether it isfrom the smaller value side or from the greater value side with respectto a specified numerical value. In this event, from bidders A, B, C andD, the bidder D who has offered the smallest value within apredetermined range is determined as a successful bidder. It should benoted that in the bidding systems illustrated in FIGS. 44A through 44,if a plurality of bidders fall under successful bidders (the bidder Cand D shown in the respective figures), the bidders are narrowed downbased on predetermined rules, which will be described later.

Alternatively, a plurality of numerical values may be selected on thenumerical value dimension selection screen J illustrated in FIG. 38.When two or more of the plurality of numerical value selection buttons131 to 137 are selected, a successful bid priority order setting screenWA similar to that illustrated in FIG. 13 is displayed. The successfulbid priority order setting screen WA is provided with entry fields WA1to WA4 for specifying a maximum of n numerical values for a firstpriority, a second priority, . . . , an n-th priority (in this example,n=4), and an OK button 61. Numerical values of the first priority, thesecond priority, . . . , the n-th priority can be specified, and thepriority order of the specified numerical values can be set freely bythe user. A price may be set to a numerical value of the second priorityor lower.

A plurality of numerical values can be set in this way because only onenumerical value, for example, is not sufficient to narrow down to apredetermined number of successful bidders (generally one) in somecases, and are used to definitely narrow down bidders to a desirednumber of successful bidders. Then, successful bid order data D5comprised of the successful bid order set on the screen WA istransmitted to the server 21. When a plurality of numerical values areselected, the server 21 can narrow down bidders in the order ofnumerical values of higher priorities, i.e., narrows down bidders to apredetermined number with the numerical value of the first priority, andagain narrows down to a predetermined number with the numerical value ofthe second priority, and so on to eventually determine a successfulbidder.

Further, information may be traded by selecting the information tradebutton 107 on the auction HP of FIG. 24. Specifically, when a certainarticle or service is desired, the auction is used for a trade to buyrequired information from the owner of the article, a company whichsells the article, or a person who knows about a provider or a providingcompany of the service. Traded information may be in any fields andcategories. Giving an example, when a length is selected for a numericalvalue, information on a provider who is offering, for example, a longestarticle may be selected from third parties at auction.

For providing information, an information entry button 117 is selectedon the numerical value auction HP to display an information provisionscreen NA illustrated in FIG. 42. The screen NA is provided with acollected information display field NA1, an information fee(compensation for providing information) display field NA2, aninformation entry field NA3, an information attachment button NA4, aremaining time display field NA5, an ID number entry field NA6, and atransmission button 141. The information provision screen NA isdisplayed when a person selects the information entry button 117 on thenumerical value auction HP screen to select a portion which he wants toview from an information collection list displayed according tocategories and fields. The information provision screen NA displays thecontents of information which a client is looking for in the collectedinformation display field NA1, and an information fee in the informationfee display field NA2, so that a viewer who can provide desiredinformation enters (fills) provided information in the information entryfield NA3, or attaches data by manipulating for attachment on the nextscreen which is displayed when he selects the append button NA4, entershis ID number, followed by transmission of the information. Informationdata D17 as bid information comprised of information entered on thisscreen NA is transmitted to the server 21 and stored in the bidmanagement DB 24.

For example, when information desired by a user is transmitted to theserver 21, the server 21 searches the management data in the bidmanagement DB 23 for pertinent information, and immediately collects theinformation when the information is not urgently required so that acollection time is allowed to some extent. Then, after the expiration ofa limited time, i.e., a remaining time has been exhausted, collectedinformation is analyzed to transmit information which most matches theneeds of the client to a terminal 30 of the client. In this event, theclient can select and specify one of the aforementioned bid forms, sothat a successful bidder is determined in accordance with the rule ofthe specified bid form. The client who has acquired the desiredinformation pays the information fee and an additional commission. Theinformation fee is paid to the successful bidder. It should be notedthat provided information may be entered before or after the server 21receives a request.

As a result of an auction, information on a single successful bidder isbasically transmitted to the client. However, if the client wishes, aplurality of narrowed down candidates may be presented, as illustratedin a list screen XC of FIG. 43. Specifically, the server 21 createsinformation offered by bidders, as it is, into a list, or creates apriority list by narrowing down successful bidder candidates of higherpriority levels, for example, into a limited number specified by theclient, based on information offered by bidders, and transmits thecreated list to the terminal 30 of the client. Then, the list XCillustrated in FIG. 43 is displayed on the terminal 30 of the client.The screen XC is provided with a list XC1, an entry field XC2 forselecting a successful bidder, and a decision button 142. The list XC1indicates a priority number, a code number, and a numerical value(length, height, area, volume, bulk, weight, amount and so on), price,conditions offered by a bidder (supplementary items (extra) and so on).

The client reviews offered conditions such as a trading date in the listXC1 on the screen XC to determine a bidder favorable for him as asuccessful bidder, enters, for example, the priority number of thewinning bidder in the entry field XC2, and selects the decision button142. In response, the server 21 notifies the client and the successfulbidder of the successful bid. When the list XC1 can be viewed on theterminal 30 of the client in this way, the client can select a partnerwhich offers favorable conditions in terms of other numerical valuessuch as the price, in addition to a specified numerical value, if aplurality of bidders offer the same numerical value, or can select apartner who may concede in the price, supplementary items and so on,even if the partner offers a numerical value slightly worse than thefirst bidder.

Next, the procedure flow of the numerical value auction according tothis embodiment will be explained with reference to FIG. 45. It shouldbe noted that the procedure flow does not necessarily show a processingprocedure of the server 21 but shows a procedure (flow) of the entirenumerical value auction.

First in S1010, a client selects an article or a service on thenumerical value auction HP. Specifically, the client selects a buttonassociated with an article or a service desired by him within theselection buttons on the numerical value auction HP.

In S1020, the client selects a numerical value (length, height, area,volume, bulk, weight, amount, or the like) with which a bid isconducted.

In S1030, the client selects bid conditions (required items such as abid form, a range, a bidding period and so on) for the numerical value.It should be noted that a procedure in S1020, S1030 for displaying arequest screen on the terminal 30 of the customer, and receiving data(bid information data D15) entered on the screen at the server 21,corresponds to a request procedure.

In S1040, the numerical value auction is started. Specifically, theserver 21 notifies third parties of a collection of bidders, anddelivers data on the numerical value to terminals 30 of the thirdparties.

In S1050, a numerical value is entered. Specifically, bidders whoparticipate in the numerical value auction enter bid information relatedto the numerical value. It should be noted that the procedure in S1040for starting the auction to display the bid screen on the terminals 30of the bidders, and in S1050 for receiving the entered data(article/service registration data D14, bid data D16, information dataD17) at the server 21 corresponds to a bid procedure.

In S1060, it is determined whether or not any application is made to theauction. In other words, the presence or absence of a bid from a bidderis determined. If there is no bid, the server 21 waits for bids. Ifthere is a bid, the procedure flow continues to S1070. This bid includesprovision of information. It should be noted that a procedure executedfrom S1060 to S1170 corresponds to a bid acceptance procedure.

In S1070, bid information is acquired to execute the bid processing withthe numerical value which has been offered as one piece of informationwithin the bid information. If a plurality of numerical values areselected and set, the bid is conducted with a value of a first priority.Then, in comparison with the desired conditions (the priority rulesshown in FIGS. 44A through 44E) in terms of the numerical value(s)within the bid information, a priority order is determined for thebidders as trading partners.

In S1080, it is determined whether or not a limited time has expired.When within the limited time, the procedure flow returns to S1050 torepeat the processing from S1050 to S1080 to execute the bid processingeach time a new bidder applies, until the limited time expires. At theexpiration of the limited time, the procedure flow continues to S1090.

In S1090, it is determined whether or not a bid-off self selection isset. The procedure flow continues to S1100 when the bid-off selfselection is not set, and to S1140 when the bid-off self selection isset.

In S1100, it is determined whether or not a successful bidder isdetermined. In other words, it is determined whether bidders arenarrowed down to a predetermined number of successful bidders. Theprocedure flow continues to S1110 if the bidders are not narrowed downto the predetermined number of successful bidders, and to S1160 if thebidders have been narrowed down to the predetermined number ofsuccessful bidders.

In S1110, it is determined whether there are any remaining numericalvalues which have not been processed for the bid, when a plurality ofnumerical values had been set. The procedure flow continues to S1120 ifthere are still remaining numerical values, and otherwise to S1160.

In S1120, a current numerical value is replaced with another one.

In S1130, the bid processing is executed with the replaced numericalvalue to narrow down bidders to a predetermined number of successfulbidders. The bidders are narrowed down to the predetermined number ofsuccessful bidders by comparing the other numerical value (of the secondpriority) within the bid information with the desired conditions (thepriority rules shown in FIGS. 44A through 44E). If the bidders cannot benarrowed down even with this bid processing, the current numerical valueis replaced with another numerical value of the next lower priority, ifthere are still other numerical values which have not yet been used inthe bid processing, to narrow down the bidders (S1110). The bid isconducted step-wisely with a different numerical value until the biddersare narrowed down to the predetermined number of successful bidders orthe bid processing has been completed with all the numerical values setin the bid information.

In S1160, the narrow-down processing is executed. Specifically, whenthere is no numerical value for conducting a bid at the next stage, abidder who has offered the price that most satisfies the requirements ofthe user is determined as a successful bidder. On the other hand, if aprice is fixed or if a price itself is not handled in a bid, successfulbidders are narrowed down to a predetermined number in accordance with apreviously defined predetermined rule.

On the other hand, if it is determined in S1090 that the bid-off selfselection is set, the list screen XC illustrated in FIG. 43 is displayedin S1140 for enumerating bid information of a predetermined number ofbidders in a list form. The user can view the list screen XC byselecting a screen display after entering a password on the screen ofthe terminal 30. The list screen XC enumerates candidates in a priorityorder in terms of the numerical values (displayed as the code number),so that the user can determine a trading partner while referencing otherinformation offered by the bidders. Upon determining a trading partner,the user enters the associated code number in the successful bidderselection entry field XC2 and then selects the decision button 142. Thesuccessful bidder information selected by the user is transmitted to theserver 21 through the Internet N.

In S1150, it is determined whether or not a successful bidder has beendetermined. The list screen XC is continuously displayed (S1140) untilthe user determines a successful bidder, and the procedure flowcontinues to step S1170 when a successful bidder is determined.

In S1170, the server 21 notifies both the user and the successful bidderof the establishment of the trade.

Next, listed below are specific examples of “length/space”, “weight” and“number/amount” for the numerical value auction, which are set as thenumerical value.

(1) First, in examples of numerical values representative of“length/space”, a buyer selects a seller who provides the greatestheight, greatest length, widest area, largest volume, or largest bulk,or information on the seller through the numerical value auction.

A buyer may select a seller who provides a helicopter, an airplane, anaeronaut, a rocket, a satellite, or the like which flies to the greatestheight, or information on the seller through the numerical valueauction.

A buyer may select a seller who provides the highest or longestbuilding, advertising display, ladder, crane, person, sample, tree, orthe like, or a land, a mine, a steel tower, an aeronaut, a satellite orthe like at the highest level from the see level, or information on theseller through the numerical value auction.

A buyer may select a seller who provides the widest land, building,advertising display, pool, sales place, stadium, parking area, room,warehouse, application facility place, car, furniture, carpet, orelectric appliance product, or information on the seller through thenumerical value auction.

A buyer may select a seller who provides a newspaper, a magazine, abook, a brochure, a leaflet, a home page, an advertising display, anadvertising medium, or the like which provides the widest space, orinformation on the seller through the numerical value auction.

A buyer may select a seller who provides a car, a ship, an airplane, atrain, an aeronaut, a satellite, or the like which has the largestloading bulk or volume, or a ground-based tank, a storage facility, awarehouse, an electric appliance product, a container, a storage, abathroom, a waste, a processing facility, an article, or the like whichhas the largest volume, or information on the seller through thenumerical value auction.

(2) In the next examples, a buyer selects a seller which provides thesmallest height, the smallest length, narrowest range, smallest volume,or smallest bulk, or information on the seller through the numericalvalue auction.

A buyer may select a seller who provides a helicopter, an airplane, anaeronaut, a rocket, a satellite, or the like which flies at a smallestheight, or information on the seller through the numerical valueauction.

A buyer may select a seller who provides a transportation car, a bus, ataxi, a train, an airplane, a helicopter, or the like which runs theshortest distance to a destination, or information on a road, a bus, atrain, an airplane, or the like through the numerical value auction.

(3) In the next examples, with the same numerical value, a sellerselects a buyer who desires the greatest height, greatest length, widestarea, largest volume, or largest bulk, or information on the buyerthrough the numerical value auction, contrary to the aforementioned (1).

A seller may select a buyer who desires a helicopter, an airplane, anaeronaut, a rocket, a satellite, or the like which flies to the greatestheight, or information on the buyer through the numerical value auction.

A seller may select a buyer who desires the highest or longest building,advertising display, ladder, crane, person, sample, tree, or the like,or a land, a mine, a steel tower, an aeronaut, a satellite or the likeat the highest level from the see level, or information on the buyerthrough the numerical value auction.

A seller may select a buyer who desires the widest land, building,advertising display, pool, sales place, stadium, parking area, room,warehouse, application facility place, car, furniture, carpet, orelectric appliance product, or information on the buyer through thenumerical value auction.

A seller may select a buyer who desires a newspaper, a magazine, a book,a brochure, a leaflet, a home page, an advertising display, anadvertising medium, or the like which provides the widest space, orinformation on the buyer through the numerical value auction.

A seller may select a buyer who desires a car, a ship, an airplane, atrain, an aeronaut, a satellite, or the like which has the largestloading bulk or volume, or a ground-based tank, a storage facility, awarehouse, an electric appliance product, a container, a storage, abathroom, a waste, a processing facility, an article, or the like whichhas the largest bulk, or information on the buyer through the numericalvalue auction.

(4) In the next examples, a seller selects a buyer who desires thesmallest height, the smallest length, the narrowest range, or thesmallest volume, or information on the buyer through the numerical valueauction.

A seller may select a buyer who desires a helicopter, an airplane, anaeronaut, a rocket, a satellite, or the like which flies at a smallestheight, or information on the buyer through the numerical value auction.

A seller may select a buyer who desires a transportation car, a bus, ataxi, a train, an airplane, a helicopter, or the like which runs theshortest distance to a destination, or information on a road, a bus, atrain, an airplane, or the like through the numerical value auction.

(5) Next, in examples of numerical values representative of “weight”, abuyer selects a seller who offers the greatest weight in transportation,processing, purchase, or the like, or information on the seller throughthe numerical value auction.

-   -   A buyer may select a seller who sells the greatest weight of a        combustible such as petrol, coal, gasoline or the like, raw        materials such as ore, clay, ballast and debris, water, wood or        the like, natural products, agricultural products, aquatic        products, marine products, food and beverage, articles, chemical        raw materials, chemicals, fertilizers, machines, products,        semi-finished products, or the like, or information on the        seller through the numerical value auction. Alternatively, a        buyer may select a provider or an organization which provides a        porter, a transportation company, a ship capable of        transporting, a railway, a car, an airplane, an aeronaut, a        rocket, transportation equipment or the like which transport the        greatest weight of these loads, or information on the provider        or the organization through the numerical value auction.

A buyer may select a dealer, a dealing company, an organization, or thelike which processes the greatest weight of wastes, sludge, excrement,or the like, or information associated therewith through the numericalvalue auction. Alternatively, a buyer may select a facility, a machine,or the like which can process the greatest weight of such wastes to beprocessed, or information associated therewith through the numericalvalue auction. Further alternatively, a buyer may select a porter, atransportation company, or the like which can transport the greatestweight of such wastes to be processed, or information associatedtherewith through the numerical value auction.

A buyer may select a dealer, a dealing company, or the like whichrecycles wastes such as the greatest weight of used paper, emptycontainers, wasted materials, wasted objects, wasted metals, plastic,oil, electric products, household effects, clothing, and so on, orinformation associated therewith through the numerical value auction.Alternatively, a buyer may select a facility, machine, a system, apatent, or the like which can recycle the greatest weight of suchwastes, or information associated therewith through the numerical valueauction. Further alternatively, a buyer may select a porter or atransportation company which can transport the greatest weight of suchwastes, or information associated therewith through the numerical valueauction.

A buyer may select a seller who has a right of emitting a greatestweight of CO₂ gas, SO₂ gas, or a substance specified by the buyer, orinformation on the seller through the numerical value auction.

A buyer may select a warehouse, facility equipment, a system, a company,or the like which stores the greatest weight of gas, liquid, or solid,or information associated therewith through the numerical value auction.Alternatively, a buyer may select a system, a design drawing, a patent,a machine, a facility, a device, a factory, a company, or the like forprocessing the greatest weight of such materials, or informationassociated therewith through the numerical value auction.

(6) In the next examples, a seller selects a buyer who indicates thegreatest weight in transportation, processing, sales, or the like, orinformation on the buyer through the numerical value auction.

A seller may select a buyer who buys the greatest weight of acombustible such as petrol, coal, gasoline or the like, raw materialssuch as ore, clay, ballast and debris, water, wood or the like,agricultural products, forest products, food and beverage, or the like,chemical raw materials, chemicals, fertilizers, products, semi-finishedproducts, or the like, or information on the seller through thenumerical value auction. Alternatively, a seller may select atransportation car, a transportation company, a car capable oftransporting, a railway, a ship, an airplane, an aeronaut, a rocket,transportation equipment, a device, or the like which transport thegreatest weight of these materials to be processed, or informationassociated therewith through the numerical value auction.

A seller may select a consumer who consumes the largest amount ofelectricity, water, gas, combustible, or the like, or information on theconsumer through the numerical value auction. Alternatively, a sellermay select power transmission, water supply, air supply, atransportation device, a system, a business entity which sends thelargest amount of electricity, water, gas, combustible, or the like, orinformation associated therewith through the numerical value auction.

A seller may select a buyer who buys the greatest weight of articles tobe disposed, stocks, valuable wastes, or second hand articles, orinformation on the buyer through the numerical value auction.

A seller may select a buyer who buy a right of emitting a greatestweight of CO₂ gas, SO₂ gas, or a substance specified by the seller, orinformation on the buyer through the numerical value auction.

(7) In the next examples, a buyer selects a seller who offers thesmallest weight in transportation, processing, purchase, or the like, orinformation on the seller through the numerical value auction.

A buyer may select a seller who sells a combustible, a raw material,vinyl, plastic, wrapping materials, containers, things of dailynecessity, electric appliances, furniture, clothing, semi-finishedproducts, articles, or the like which generates the smallest weight ofCO₂, poisonous gas, emission regulated material, or a substancespecified by the buyer, or the like, when it is burnt, or information onthe seller through the numerical value auction.

A buyer may select an electric product, a machine, a device, asemi-finished product, an article, a agricultural or marine product,forest products, seeds, processed food, a system, design drawings, apatent or the like which mixes or use the smallest weight of radiation,gas, water, solvent, detergent, foaming material, redox agent,corrosive, color former, disinfectant, agricultural chemicals, oil,mixing agent, a substance specified by the buyer, or the like, orinformation associated therewith through the numerical value auction.

A buyer may select a car, a ship, an airplane, a train, a rocket, amachine, a facility, an atomic power generation engine, or the likewhich emits or generates the smallest weight of radiation, exhaust gassuch as CO₂ gas, nitrogen, phosphate compound and so on, emissionregulated substance or the like, a substance specified by the buyer, orthe like, or information associated therewith through the numericalvalue auction.

A buyer may select a land, a building, a product, an article, a factory,a company, a device, a facility, an atomic power generator, designdrawings, a system, a patent, or the like which emits or generates thesmallest weight of radiation, exhaust gas such as CO₂ gas, nitrogen,phosphate compound and so on, emission regulated substance or the like,a substance specified by the buyer, or the like, or informationassociated therewith through the numerical value auction.

A buyer may select a system, design drawings, a patent, a machine, afacility, a factory, a company, a product, or the like which emits orgenerates the smallest weight of radiation, gas, liquid or solid, orinformation associated therewith through the numerical value auction.

A buyer may selects a seller who has a right of emitting the smallestweight of CO₂ gas, SO₂ gas, or a substance specified by the buyer, orthe like, or information on the seller through the numerical valueauction.

(8) In the next example, a seller selects a buyer who offers thesmallest weight in transportation, processing, purchase, or the like, orinformation on the seller through the numerical value auction.

When a seller sells or orders processing of industrial wastes, materialsto be processed, recovered materials, second hand products, rawmaterials, intermediate products, or the like, the buyer may select apurchaser or a process engineer, or a legal person which purchases orprocesses, or an organization which possesses a factory, a machine, afacility, a technology, or the like which generates or emits thesmallest weight of radiation, CO₂ gas, emission regulated gas, poisonousgas, polluted water, liquid waste, polluted substance, emissionregulated substance, final waste, a substance specified by the seller,or the like in course of processing, repair, working, or the like, orinformation associated therewith through the numerical value auction.

A seller may selects a buyer who has a right of emitting the smallestweight of CO₂ gas, SO₂ gas, or a substance specified by the seller, orinformation on the buyer through the numerical value auction.

(9) Next, in examples of numerical values representative of“number/amount,” a buyer selects a seller who offers the largest numberor amount in transportation, processing, purchase or the like, orinformation on the seller through the numerical value auction.

A buyer may select a seller who sells the largest amount of contained orpackaged combustible, row materials, food, articles, chemicals,products, semi-finished products, or the like, or information on theseller through the numerical value auction. Alternatively, a buyer mayselect a transportation car, a transportation company, a car capable oftransporting, a ship, a train, an airplane, an aeronaut, a rocket, atransportation machine, a device, or the like which transports thegreatest weight of these loads, or information associated therewiththrough the numerical value auction.

A buyer may select a dealer, a dealing company, or the like whichrecycles the largest amount of contained or packaged combustible, rowmaterials, food, articles, products, semi-finished products, electricproducts, household stuffs, clothing, machines, or the like, orinformation on the seller through the numerical value auction, or mayselect a facility, a machine, a system, a patent, or the like whichrecycles the largest amount, or a transportation car, a transportationcompany, or the like which transports the largest amount, or informationassociated therewith through the numerical value auction.

A buyer may select a system, a warehouse, a facility, a device, acompany, or the like which stores the largest amount of contained gas orliquid, packaged solid, or the like, or a system, a design, a patent, amachine, a facility, a device, a factory, a company, or the like whichprocesses such object, or information associated therewith through thenumerical value auction.

A buyer or a lessee may select a sales company, a financial company, atransportation/distribution company, a dealing company, a system, adesign, a patent, a machine, a facility, a device, or the like whichaccepts the largest number of times of divided payment, dividedpurchase, divided transportation/distribution, divided processing,divided working, destruction working/method, or the like, or informationassociated therewith through the numerical value auction.

A buyer may select a seller who offers the largest number of scanninglines, pixels, storage capacity, transmission speed, processing speed,resolution, magnification, or the like, when the buyer is going to buy atelevision set, a cathode-ray tube, a display device, a video camera, adigital camera, a semiconductor device, a memory chip, a computer, anInternet terminal, a telephone, a server, a floppy disk, a projector, atelescope, or the like, or information on the seller through thenumerical value auction.

A buyer may select a seller who offers, produces or sells the largestnumber or amount for the amount of created manuscripts for planningadvertisement, the amount of created manuscripts for advertisements andarticles on newspaper, television, radio, publication and Internet, thenumber of produced or sold videos, records, CDs, MDs, DVDs, the numberof annual tickets for membership clubs, the number of rooms inaccommodations, or the like, or information associated therewith throughthe numerical value auction.

(10) In the next examples, a seller selects a buyer who offers thelargest number or amount in transportation, processing, sales, or thelike, or information on the buyer through the numerical value auction.

A seller may select a buyer who purchases the largest amount ofcontained or packaged combustible, row materials, food, articles,chemicals, products, semi-finished products, or the like, or informationon the seller through the numerical value auction. Alternatively, aseller may select a transportation car, a transportation company, a carcapable of transporting, a ship, a train, an airplane, an aeronaut, arocket, a transportation machine, a device or the like which transportthe greatest weight of these loads, or information associated therewiththrough the numerical value auction.

A seller may select a consumer who consumes the largest amount ofcontained water, gas, combustible or the like, or information on theconsumer through the numerical value auction. Alternatively, a sellermay select a porter, a transportation company or the like, or a car, aship, a train, an airplane, an aeronaut, a rocket, a transportationmachine or a device capable of transporting, or a device, a system, abusiness entity, or the like which transports the greatest weight ofthese loads, or information associated therewith through the numericalvalue auction.

A seller may select a buyer who buys the largest amount of articles tobe disposed, stocks, valuable wastes, or second hand articles, orinformation on the buyer through the numerical value auction.Alternatively, a seller may select a porter or a transportation companycapable of transporting the largest amount of such loads, or a car, aship, a train, an airplane, an aeronaut, a rocket, a transportationmachine or a device capable of transporting, or information through thenumerical value auction.

A seller or a lessor may selects a buyer, a lessee, an organization, asystem company, a distribution/sales company, or the like which acceptsthe largest number of times of divided payment, divided purchase, anddivided transportation, distribution and sales, or the like, orinformation associated therewith through the numerical value auction.

(11) In the next examples, a buyer selects a seller who offers thesmallest number or amount, or information on the seller through thenumerical value auction.

A buyer or a lessee may select a sales company, a financial company, atransportation company, a processing company, a dealing company, asystem, a design, a patent, a machine, a facility, a device, or the likewhich accepts the smallest number of times of divided payment, dividedpurchase, divided transportation, divided processing, divided working,destruction working/method, or the like, or information associatedtherewith through the numerical value auction.

A buyer may select a system, a design, a patent, a machine, a facility,a device, a dealing company, or the like which can assemble ormanufacture a building, a machine, a product, an article, or an objectwith the smallest number of parts, steps, works, or the like, orinformation associated therewith through the numerical value auction.

(12) In the next example, a seller selects a buyer who offers thesmallest number or amount, or information on the buyer through thenumerical value auction.

A seller or a lessor may select a buyer, a lessee, an organization, asystem company, or the like which accepts the smallest number of timesof divided payment, divided purchase, divided transportation, dividedprocessing, divided working, destruction working/method, or the like, orinformation associated therewith through the numerical value auction.

As appreciated from the foregoing, the following advantages are providedaccording to the fifth embodiment.

With the employment of the auction system in which a requester (client)offers a desired trading condition with respect to a numerical valuesuch that bidders complete with the numerical value, the client canconduct an auction with a numerical value other than the price, and finda trading partner who satisfies the requirements in accordance with theparticular client in terms of the numerical value.

In the numerical value auction of this embodiment, a plurality ofnumerical values can be selected from length, area, weight, and so on,so that the client can select a trading partner who more satisfies therequirements of the client at auction.

The fifth embodiment employs the information auction in which the serveraccepts a request for information, widely addresses third parties toprovide the requested information through the Internet N such thatbidders compete with a numerical value included in the providedinformation to determine an information provider (bidder) who hasoffered the information that most matches the requirements of the clientas a successful bidder. It is therefore possible to acquire mostappropriate information as to how one can be provided with a desiredarticle or service even if a provider or a providing company of such anarticle or a service does not participate in the auction. By thustrading information possessed by third parties, it is possible toeffectively use information which is valuable for other persons viewedfrom the third parties.

Sixth Embodiment

Next, a sixth embodiment which embodies the present invention will beexplained with reference to FIGS. 1, 4, and 46 through 58. The sixthembodiment differs from the foregoing embodiments in that an auction isconducted such that bidders compete with a numerical value indicative ofevaluation.

An auction system for conducting an evaluation numerical value auctionis substantially similar in configuration to that illustrated in FIG. 1.FIG. 1 illustrates an auction system for conducting an auction for anarticle or a service between a seller and a buyer through a network. Theauction system comprises an auction management system 20, a network (theInternet in this embodiment) N, and terminals 30 of users (customers).

The auction management system (intermediary management server system) 20comprises a server (web server) 21, a customer/article managementdatabase (DB) 145, a bid management database (DB) 146, and an evaluationdata management database (DB) 147. It should be noted that the server 21may be configured of a plurality of servers, such as a separate webserver and application server.

The server 21 is connected to the Internet N and further connected toterminals 30 of third parties for communications therewith through theInternet N. The terminals 30 may be personal computers (hereinaftersimply called the “personal computer”) 31 of a manufacturer orindividuals, or portable telephones 32 having the ability of makingcommunications through the Internet (for example those supporting thei-mode). It is only individuals and dealers (manufacturers, stores, andso on) which have previously registered as users that are allowed toreceive a customer provision service from the server 21. In the auctionsystem according to this embodiment, the server 21 accepts a requestfrom a client, and collects articles or services which most satisfyrequirements of the client. On the other hand, when a client is aprovider of an article or a service, the server 21 collects potentialbuyers. Then, the server 21 evaluates, in the form of numerical value,applied (offered) articles or services or persons (buyers) who may beprovided with an offered article or service from a viewpoint of therequirements of the client. Then, the server 21 determines the one whoscores the evaluation value that most satisfies the requirements of theclient as a successful bidder. In the following, this type of auctionwill be referred to as the “evaluation auction”. More specifically, inthe evaluation auction, an article or a service desired by a client isevaluated in the form of numerical value whether or not the article orthe service satisfies requirements of the client. From a large number ofbid information (articles, services, or the like) which have beenpreviously registered, or collected each time a request is made, anevaluation point (numerical value) about an article or a service, or anobject or a person who serves for the service, which most satisfies therequirements of the client, is determined as a successful bid.

FIG. 46 illustrates the functional configuration of the auctionmanagement system 20. The auction management system 20 comprises acommunication unit 148, a control unit 149, a bid computing unit 150, asuccessful bid narrow-down computing unit 151, and an evaluationcomputing unit 152. The communication unit 148, control unit 149, bidcomputing unit 150, successful bid narrow-down computing unit 151, andevaluation computing unit 152 are implemented by the server 21. Thecommunication unit 148 operates in accordance with a predeterminedcommunication protocol (e.g., HTTP). A bid management DB 146 stores dataand so on required for a bid, and comprises a bid condition storage unit153 which includes a bid data storage unit 154 and a narrow-down datastorage unit 155. An evaluation data management DB 147 stores data andso on required for numerical value evaluation of an article or aservice, and comprises an evaluation data storage unit 156 and aconversion data storage unit 157. The control unit 149 and therespective computing units 150 to 152 are used for computing control fora numerical value evaluation or bid processing for competing with thenumerical value in the evaluation auction, and a variety of data storedin the respective storage units 153, 156, 157 are used for the computingprocessing. The evaluation numerical value, with which a bid isconducted, is not limited to a pure numerical value, but may be anevaluation rank, for example, A, B, C, and so on, as long as it is akind of numerical value which can be compared by computer processing.

An auction home page (HP) (site) resides in the server 21 of anintermediary company. A user (customer) displays an auction HPillustrated in FIG. 47 on a screen through the network N using a browserapplication from a terminal 30 for viewing the auction HP. A variety ofscreens such as the user registration screen P similar to thatillustrated in FIG. 4, a request registration screen E illustrated inFIG. 48, a bid registration screen K illustrated in FIG. 52, aninformation provision screen NB illustrated in FIG. 53, and so on arelinked to the auction HP. The server 21 stores in its hard disk, screendata for the variety of screens HP, P, E, K, NB and so on, a program foruse in displaying the screens and so on (for example, an HTMLdescription program), a program for use in computing processing involvedin the auction, and so on.

As illustrated in FIG. 47, the auction HP is provided with userregistration button 103, a request registration button 104, aninformation entry button 117, a direct trade button 106, an informationtrade button 107, and a large number of selection buttons 100 classifiedinto respective articles and services potentially traded in the auction,such as food, recruiting, culture school, real estate, finance, venture(entrepreneurial activity), antique objects, and so on, options 108 fora client to select a normal auction or a counter-auction, and a decisionbutton 130. It should be noted that FIG. 47 illustrates only a portionof article and service classifications. Selection of the userregistration button 103 results in the registration screen P (FIG. 4)displayed on the terminal 30.

As illustrated in FIG. 4, the user registration screen P is providedwith options P1 for selecting whether the user wants to participate inan auction as a seller or a buyer, and a variety of entry fields P2 forentering address, name, telephone number, electronic mail address, sex,age, remarks, and so on. When the user has entered all required items inassociated fields on the user registration screen P displayed on theterminal 30A and selects an OK button 55, the just entered userregistration data D1 is transmitted to the server 21 through the networkN and stored in the customer/article management DB 145. Upon confirmingthat the user has paid a predetermined commission, the server 21transmits an authentication number (ID and password) to the terminal 30Aof the registered user. The registered user uses the authenticationnumber for utilizing the auction.

A client may request for an evaluation auction in two different ways:“direct trade” for directly looking for an object to be traded (atrading partner or an article/service) and “information trade” forlooking for information on an object to be traded (a trading partner oran article/service). A client selects the request registration button104 for conducting the “direct trade” and the information entry button117 for conducting the “information trade”. In either the “direct trade”or the “information trade,” the client specifies a normal auction forbidding off an article or a service or a counter-auction for bidding offa buyer of an article or a service with the options 108, and selects aselection button 100 associated with a classification to which a desiredarticle or service belongs. The direct trade button 106 and theinformation trade button 107 are provided for selecting the “directtrade” or the “information trade” upon conducting a bid, respectively.

When the client selects the decision button 130 while selecting adesired button 100 and the request registration button 104 or theinformation entry button 117, a request registration screen Eillustrated in FIG. 48 is displayed. The request registration screen Eis provided for identifying an article or a service to be traded, andentering requirements of a client with respect to the article orservice. The screen E is provided with a trading type indicators 160 forindicating the type of trade, i.e., the “direct trade” or the“information trade”, and a variety of entry fields E1 to E3 foridentifying an article or a service such as the name of the article orservice (for specifying details), an article number, the contents of theservice, and so on. One of “direct trade” and “information trade” in thetrading type indicators 160, which is selected by the client, remainsactive (FIG. 48 shows that “direct trade” is active).

Requirements can be entered in a plurality of different ways, so thatthe screen E is provided with a sentence entry field E4 for entering asentence which describes requirements; key word registration buttons161, 162, 163 for identifying requirements with key words; and anevaluation registration list button 164 for identifying requirements byspecifying a numerical value or the like for each evaluated item(specifications or the like). The screen E is also provided with optionsE5 for specifying a level of requirements at five levels: “very high”,“high”, “middle”, “low”, and “very low”. The options E5 are providedbecause, for example, when a word such as “good”, “low” or the likeindicative of a level is entered in a sentence, the level must bedefinitely identified. The options E5 is used as required since a levelof requirements must be identified as well when the requirements areidentified with key words, which will be described later. The screen Eis further provided with options E6 for selecting whether or not bidsare collected after the registration of the request, and an entry fieldF7 for entering a limited time. When “yes” is selected (bids arecollected) in the options E6, the server 21 delivers the requirements ofthe client to collect bidders after the registration of the request, theclient enters a desired bidding period in the time limit entry field E7.

The server 21 analyzes a sentence that describes requirements, enteredin the sentence entry field E4, and automatically allocates a key wordsuitable for the requirements by internal processing. A microcomputer inthe server 21 analyzes the sentence to extract key words which arepossibly regarded as evaluation items, thereby finding out appropriateevaluation items from the sentence. Also, the microcomputer identifieswhich of evaluation items should be given importance from the contentsof the requirements which are understood from the result of the analysison the sentence in accordance with data for specifying an evaluationpercentage to assign an evaluation percentage to each evaluation item(key word). The evaluation data management DB 147 stores database datafor extracting appropriate key words (evaluation items) from wordswithin a sentence, and the data for specifying an evaluation percentagefor assigning an evaluation percentage to each key word from theintention of the requirements (for example, the intention of therequirements identified from a sequence of combined key words) which maybe understood from the result of the analysis on the sentence.

An example of an entered sentence may be, for example, “a food which isgood, cool and healthful” or the like. In this sentence, “good” is asubjective taste, so that the microprocessor in the server 21 respondswith a query “enter the good taste in more specific terms”. The clientmay enter, for example, “sweet and good” as a detailed description onthe good taste. If the sentence is proper, it is broken down into words“sweet”, “good”, “cool”, “healthful”, and “food”, and a key word“healthful” may be extracted, by way of example, from a combination oftwo words “healthful” and “food”. With the key word “healthful”, apredetermined equation is identified and set such that a food whichcontains components indispensable for the health, such as vitamins,minerals and so on is given a greater evaluation point within componentsof the food. For example, the evaluation data management DB 147 storesevaluation data which has been created based on data submitted by theclient, previous data, and so on. The evaluation data serves as databasedata, for example, related to components data such as vitamins,minerals, and so on of a food, as well as the quality, characteristics,components, performance, title, specialty, and so on for a variety ofarticles and services, and providers of such articles and services. Anevaluation point for a key word is calculated using evaluation data inaccordance with predetermined equation associated with the key word.

Expressing “healthful” in the exemplary sentence again in more specificterms, assume that the entered sentence describes “a food which issweet, cool, good and effective for diabetes”. In this event, thesentence is broken down into the following words: “sweet”, “cool”,“good”, “diabetes”, and “food”. For example, a key word “diabetes” maybe extracted from a sequence of three words “sweet”, “food”, and“diabetes”. Also, “sweet” may be extracted as another key word. With thekey word “diabetes”, a predetermined equation is identified and set suchthat a food which contains less sugar in its contents is given a greaterevaluation point, and its evaluation percentage is higher (highpercentage). The evaluation data management DB 147 stores database datafor identifying a key word from a sequence of combined words, and fordetermining the tendency of the evaluation percentage and evaluationpoint in the manner described above. This database data has been createdbased on integrated knowledge of experts or empirical rules. When“sweet” is extracted a key word (evaluation item), a high evaluationpoint is given to a food with a high sweetness, which uses a sweetenerother than sugar, if “diabetes” is included in key words.

A client offers a desired article or service, and identifies specificrequirement, if any, in the desired article or service, by registeringkey words. The registration of key word is classified into three:“priority order registration”, “evaluation percentage registration”, and“predefined registration” which are selected by three buttons 161, 162,163, respectively. FIGS. 49, 50, 51 illustrate three types of customerregistration screens provided for a client to enter his requirements.When the client selects the button 161, 162 or 163 on the screen E, oneof the three types of request registration screens LA, LB, LCillustrated in FIGS. 49, 50, 51 is displayed. The request registrationscreen LA of FIG. 49 is provided for registering key words in the“priority order registration” which allows the client to specify apriority order for the key words. This screen LA is provided with anarticle/service display field 166, entry fields LA1 to LAn for enteringa maximum of n key words for a first priority, . . . , an n-th priorityin a priority order in which higher importance is given to the key wordsin the evaluation, and an OK button 167.

The request registration screen LB of FIG. 50 is provided forregistering key words in the “priority order registration” which allowsthe client to specify a rate in accordance with the importance of eachkey word in the form of evaluation percentage (%). This screen LB isprovided with an article/service display field 166 similar to that inFIG. 49, entry fields LB1 to LBn for entering key words with a firstpriority to an n-th priority, evaluation percentage entry fields 168 forthe key words, and an OK button 167.

The request registration screen LC of FIG. 51 is provided forregistering key words “predefined registration” for which no priorityorder is given in particular or to which a predefined priority order,which has been initially preset by a program, is applied. This screen LCis provided with an article/service display field 166, entry fields LC1to LCn for entering a maximum of n key words as evaluation items, and anOK button 167.

For the entry fields LA1 to LAn, LB1 to LBn, LC1 to LCn on therespective request registration screen LA, LB, LC, key words may beselected from those previously prepared, or freely entered.

As the evaluation registration list button 164 is selected, aregistration list EA is displayed. The registration list EA enumerates aplurality of previously provided evaluation items which are estimated tobe required for evaluating an article or a service specified by theclient. The client enters required items such as a desired numericalvalue, a range, and so on for a specified evaluation item. It should benoted that the screens E, LA, LB, LC and the registration list EAcorrespond to a request screen.

When the client has entered required items on the request registrationscreens E, LA, LB, LC and the registration list EA displayed on theterminal 30A, and selects the transmission button 165 on the screen E,bid registration data D18 as bid request information includingarticle/service related information and requirement information istransmitted to the server 21 through the network N. The requestregistration data D18 is divided into a variety of database data, asrequired, classified into respective trading types, fields and so on,and stored in the respective database 145, 147. Here, thearticle/service related information corresponds to attributeinformation.

A client may request for an evaluation auction in two different ways:“direct trade” and “information trade”. A client selects the directtrade button 106 on the evaluation auction HP screen for participatingin a bid for “direct trade,” or selects the information trade button 107on the evaluation auction HP screen for participating in a bid for“information trade”. In either the “direct trade” or the “informationtrade”, the client specifies a normal auction or a counter-auction withthe options 108, selects a selection button 100 associated with aclassification to which a desired article or service belongs, and thenselects the decision button 130. In response, a bid registration screenK illustrated in FIG. 52 is displayed when the “direct trade” isselected, while an information provision screen NB illustrated in FIG.53 is displayed when the “information trade” is selected. It should benoted that the bid registration screen K and the information provisionscreen NB correspond to a bid screen.

As illustrated in FIG. 52, the bid registration screen K is providedwith a variety of entry fields K1 to K6 for entering an article orservice name (specified in detail), an article number, the contents of aservice, a price (fee), a place, reference information, and so on; anevaluation data registration button 169 which is selected forregistering evaluation data for use in numerical value evaluation; arequirement display field K7 for displaying requirements of a client;and a requirement reference button 170. When a client specifiesrequirements without sentence (key word registration or evaluation itemregistration (specification or the like)), the requirement referencebutton 170 selected by the client results in displaying detailedrequirements for key words or evaluation items registered by the clienton an auxiliary screen.

On the other hand, when the client selects the evaluation dataregistration button 169, a registration list KA is displayed. A personwho is going to register in a bid enters required items (evaluationdata) in evaluation items and so on enumerated in the registration listKA. A client enters required items in all the fields on the bidregistration screen K displayed on the terminal 30A, and selects atransmission button 171, causing bid registration data D19 as bidinformation to be transmitted to the server 21 through the network N.Within the bid registration data D19, data associated witharticle/service management is added to the customer/article managementDB 145; data associated with evaluation management is stored in theevaluation data storage unit 156 in the evaluation data management DB147, as classified into respective fields or the like.

In the evaluation auction, requirements of a client are analyzed andreplaced with evaluation items (for example, represented by key words orthe like). Then, an associated article or service is evaluated in theform of numerical value for each of the evaluation items. Consequently,the evaluation numerical values are individually evaluated for each ofthe evaluation items, or the respective evaluation points for all theevaluation items are summed to derive a total evaluation point which isto be evaluated.

A bid is conducted in two different systems: an advanced bid system inwhich the contents of a bid are previously registered before a requestis made, and a normal bid system in which bidders are collected after arequest is made. In the advanced bid system, bid information has beenpreviously registered in the auction management system 20 before arequest is made, and when a request is made afterwards from a client, abid is conducted among bid data which have been previously registered.In the normal bid system, after accepting a request from a client, hisrequirements are widely notified on terminals 30 of third partiesthrough the network N to collect bidders. The advanced bid system issuitable when the contents of an article or a service available for thebid are fixed. Upon accepting a request, it is immediately find anarticle, a service, or a buyer which satisfies the requirements, orinformation associated therewith a short waiting time. On the otherhand, the normal bid system allows a bidder to view and confirm detailson a request of a client and participate in a bid after determine anarticle or a service which the bidder can offer, so that the client candetermines a bidder who has offers conditions preferred to therequirements as a successful bidder. The bid registration data D19 andthe bid information data D20 (see FIG. 53) are stored in thecustomer/article management DB 145 and the evaluation data management DB147, respectively when the advanced bid system is conducted, and storedin the bid data management DB 146 when the normal bid system isconducted. In the advanced bid system, the bid data stored respectivelyin the DBs 145, 147 are read for bidding upon acceptance of a requestfrom a client.

An article may be information. Specifically, when a certain article orservice is desired, an auction may be used for a trade for buyingrequired information from a person who knows an owner of the article, acompany which sells the article, or a provider or a providing company ofthe service.

Traded information may be in any fields and categories. Giving a mereexample, there is information on schools of fish (about what time whichkind of fish in which region and at which density of signs of fish)information on resources (information on where rare metals, petrol, orthe like is buried), and so on.

When entering “information on a school of fish called “OO” (in a certainregion) is wanted”, or “ . . . (in a certain place or region)”, “fishcalled “OO” (a kind of fish), and “sign of fish” are entered in the keyword entry field, the sentence is used as it is as information to widelycollect information related to this information through the Internet Nin the former case. If someone who views the information knows somerelated information, he selects an information provision button OO onthe screen. In response, an information provision screen illustrated inFig. OO is displayed, so that he enters the valuable informationpossessed by himself in an information provision entry field DD forbidding.

How to handle information on a school of fish at auction will beexplained as an example. For example, a fishing boat may providefishermen and fishing boats with information on signs of fish which isnot a target of the fishing boat itself but may be intended, forexample, by other fishing boats, other than fish which is captured bythe fishing boat. In this event, ships and so on which expect suchinformation generally want information on signs of fish from a shipnearest to them. For this purpose, the ships participate in an auctionto acquire information from the nearest ship. Specifically, a ship whichhas information on signs of fish provides the information to a server 21in an intermediary company through the Internet N. For example,fishermen and fishing boats may use the auction to look for any usefulinformation on the fishing from nearby ships. In this event, it ispossible to enter the kind of fish or the like in the priority entryfield to narrow down information. It is also possible to narrow down arange of region.

Then, the server 21 widely provides terminals 30 of third parties withsuch an outline of information that let the third parties understand towhich the information is related. A third party which views the outlinemay buy the information through the terminal 30.

For example, when an information entry button 117 is selected on theauction HP as illustrated in FIG. 47, an information provision screen NBillustrated in FIG. 53 is displayed. As illustrated in FIG. 53, theinformation provision screen NB for use in a bid for the “informationtrade” is provided with a collected information display field NB1, aninformation fee (compensation for providing information) display fieldNB2, a remaining time display field NB3, an information entry field NB4,an ID number entry field NB5, a requirement reference button 172, aninformation attachment button 173, and a transmission button 174. Thecollection information display field NB1 displays the contents ofinformation, which a client is looking for, in sentence. When a clientspecifies requirements without sentence (key word registration orevaluation item registration (specification or the like)), therequirement reference button 172 selected by the client results indisplaying detailed requirements for key words or evaluation itemsregistered by the client on an auxiliary screen. Since an informationfee is displayed in the information fee display field NB2, a viewer whocan provide the collected information enters (fills) the providedinformation in the information entry field NB4, or attaches detaileddata by entering required items such as evaluation data and so on on aregistration list NBB which is displayed when he selects the appendbutton 173, enters his ID number, followed by transmission of theinformation. Then, as the viewer selects the transmission button 174after entering his ID number, bid information data D2 as bid informationis transmitted to the server 21 through the network N.

The information provision screen NB displays the contents of informationwhich a client is looking for in the collected information display fieldNB1, and an information fee in the information fee display field NB2, sothat a viewer who can provide desired information enters (fills)provided information in the information entry field NB4, or attachesdata by entering data on evaluation items (specifications or the like)on a registration list NBB which is displayed when he selects the appendbutton 173, and manipulating for attachment, enters his ID number,followed by transmission of the information. The server 21 manages theinformation in the database 147. For example, when the client transmitsinformation on requirements to the server 21, the server 21 searches themanagement data in the database 147 for pertinent information, andimmediately collects the information when the information is noturgently required so that a collection time is allowed to some extent.Then, after the expiration of a limited time, at which a remaining timehas exhausted, collected information is analyzed to transmit theinformation which most matches the needs of the client to a terminal 30of the client. In this event, a reference of evaluation point isspecified for bidding off in accordance with a level of requirementsspecified by the client, so that a successful bidder is determined inaccordance with the specified evaluation level. The client who hasacquired the desired information pays the information fee and anadditional commission. The information fee is paid to the successfulbidder.

Alternatively, a client may only notify a desired article or service, inwhich case the server 21 stores evaluation data for properly evaluatingpreviously registered articles or services to evaluate a plurality ofpreviously determined evaluation items in the form of numerical valuesuch that the client bids off the article or service which has a hightotal evaluation point.

Next explained is a method of evaluating whether an item satisfies aclient's requirements in the form of numerical value. The requirementsare analyzed and replaced with evaluation items. Then, an associatedarticle is evaluated in the form of numerical value for each of theevaluation items (represented, for example, by key words or the like).Consequently, the evaluation numerical values are individually evaluatedfor each of the evaluation items, or the respective evaluation pointsfor all the evaluation items are summed to derive a total evaluationpoint which is to be evaluated. This evaluation point is competed, andthe client preferentially bids off an article, the evaluation point ofwhich more satisfies conditions of a bid form. In this way, the bid isconducted with numerical values which obtain evaluation points thatsatisfy the requirements.

Alternatively, a client or a bidder may only notify a desired article orservice, in which case the server 21 stores evaluation data for properlyevaluating previously registered articles or services to evaluate aplurality of previously determined evaluation items in numerical valuesuch that the client bids off the article or service which has a hightotal evaluation point.

FIG. 55 shows evaluation data D21 which records an evaluation point foreach of evaluation items associated with articles and services, whereinan evaluation point for each of evaluation items is recorded for each ofregistered articles A, B, C, . . . . In this example, the articles areevaluated on the basis of 100 points.

FIG. 56 shows equation data D22 which records equations for use inconverting a key word into a numerical value, wherein a correspondingequation is recorded for each key word. Variables in the equationscorresponds to evaluation items, so that an evaluation point iscalculated for a key word by substituting evaluation points ofevaluation items corresponding to the respective variables in theequations and calculating the equations.

For example, for looking for a food through the t numerical valueauction, when evaluation items include key words such as “safety,”“healthful”, “disease” and so on, by way of example, these requirementsare totally and properly evaluated for conversion into an evaluationpoint. To each key word, an equation has been previously set such thatthe key word is correctly evaluated. For example, with “safety”,evaluation items used as variables of an associated equation includes anatural vegetable using ratio, a synthetic seasoning using ratio, asugar using ratio, agricultural chemicals/fertilizers, minerals, and soon, each of which is given a greater point as an associated food is morehealthful to a human body. For example, an equation “Σkn (=k1, 2+ . . .n)” (where kn is an evaluation value for an evaluation item n). In thisway, an evaluation point is found in accordance with a key word based onthe evaluation data D21 and the equation data D22. With “disease”, inturn, an equation is employed such that an evaluation item (for example,a component such as a vitamin or the like) more effective for curingthis disease is more highly weighted. A food which is given a high pointto the effective evaluation item is properly evaluated so that itsevaluation point for the key word “disease” basically becomes greater.For example, for diabetes, an equation is employed such that anevaluation point for a sugar percentage is more highly weighted, so thata food having a low sugar percentage is significantly highly evaluated.The respective data D21, D22 are stored, for example, in the database147.

For example, when a client uses the screen LA of FIG. 49 for setting aplurality of key words, evaluation points for respective key words ofthe first priority to the n-th priority are weighted in the priorityorder, so that requirements of the client are totally evaluated. Forexample, a total evaluation point is calculated in accordance with itspredefined evaluation percentage, for example, 100% for the firstpriority, 80% for the second priority, . . . , 10% for the n-thpriority, and so on. When the screen LB of FIG. 50 is used, evaluationpoints for respective key words of the first to the n-th priority areweighted in accordance with corresponding evaluation percentage % tocalculate a total evaluation point. When the screen LC of FIG. 51 isused, respective key words are equivalently evaluated with an equalevaluation percentage. It should be noted that requirement data (forexample, key words and so on) from the client, which is information thatis the basis for conversion into numerical values such as evaluationpoints for individual items and a total evaluation point correspond toinformation under evaluation.

FIG. 54 illustrates an evaluation result display screen O. For example,when a client sets a plurality of key words, candidate articles (orservices) which satisfy requirements are displayed in the order ofgreater total evaluation points as illustrated in FIG. 54. On thisscreen O, an individual evaluation point for each evaluation item (keyword) and a total evaluation point are displayed for the respectivearticles (or services) selected as candidates. The number of biddersenumerated in a list on the evaluation result display screen O isdetermined by the server 21, and are narrowed down to a fixed percentageof all bidders, or to a fixed number of bidders specified by the client.When the client can view the evaluation result display screen O on theterminal 30, the client can select by himself a successful bidder or anarticle with reference not only to the total evaluation point but alsoto an individual evaluation point for each of the evaluation items.

On the screen O, a bid-off button 175 at a right end positioncorresponding to an article (or a service) ranked at the first positionas a successful bid candidate is displayed as selected. When the clientwants to individually view an evaluation point for each key word andchanges an article to be bidden off to an article at a lower rankcandidate, the client may select a right end position corresponding tothe article to switch the position at which the bid-off button 175 isselected to the position of the selected article. Then, the clientselects an OK button 176 with the bid-off button 175 being selected. Onthe other hand, for a correction or a cancel, a correction button 177may be selected. As the client selects an article to be bidden off andselects the OK button 176, the associated bid-off data is transmitted tothe server 21, which, upon receipt of the bid-off data, notifies boththe seller and the buyer of the establishment of the trade. Of course,information on a successful bidder may only be transmitted to theclient. In other words, the server 21 determines the bidder who hasobtained the highest total evaluation point as a successful bidder, andnotifies the client to that effect together with details on theevaluation.

Next, an auction procedure will be explained with reference to a flowchart of FIG. 57.

First in S2010, an article/service is selected. Specifically, on theauction HP, the type of trade (direct trade, information trade) isselected by the buttons 106, 107, and the field of the article/serviceis identified by selecting a selection button 100. Subsequently, thedecision button 130 is manipulated, and a desired article or service isspecifically identified in the identified field on the next screen(request registration screen) E (however, depending on the field, anarticle or the like may have been previously identified before therequest registration screen E is displayed). It should be noted that aprocedure of receiving the data entered in S2010 to 2040 at the server21 corresponds to a request procedure.

In S2020, requirements on the article or service are entered.Specifically, for entering the requirements as a sentence, the sentenceis entered in a sentence entry field E4 on the request registrationscreen E. On the other hand, when the requirements are to be identifiedusing key words, one of three buttons 161, 162, 163 is selected on therequest registration screen E. Then, on the next screen LA, LB, LCassociated with the selected button, key words are entered. In addition,on the screen LB, an evaluation percentage for each key word is enteredin an evaluation percentage entry field 168. Also, for specificallyentering numerical values or the like for evaluation items(specifications or the like), the numerical values or the like for theevaluation items (specifications or the like) are entered on a list EAwhich is displayed when an evaluation registration list button 164 isselected.

In S2030, it is determined whether the requirements have been entered asa sentence or as key words. For a sentence, the procedure flow continuesto S2040, while for key words, the procedure flow continues to S2050.

In S2040, the sentence is analyzed to extract key words from thesentence. Here, the sentence analysis involves dividing the sentenceinto words (nouns, adjectives, and so on), determining whether or noteach of the words is found in registered words in the database, andselecting a key word associated with the registered word if found. Also,since a certain word may only have abstract and vague meaning so thatthe word alone cannot be used as the basis for evaluation (for example,“good”), the meaning is found in consideration of the relationship withother words such as those previous and subsequent to that word, and akey word pertinent to the resulting meaning is also selected. Further,if there are a plurality of key words associated with a matchingregistered word, the key words are narrowed down from the meaning foundfrom the relationship among the words. In this event, since the articleor service has been already determined, an appropriate key word isextracted in consideration also to their natures and characteristics.Moreover, if a word has too vague meaning to narrow down key words, theclient is required to re-enter a specific word.

In S2050, an evaluation auction is started. Specifically, the server 21creates a bid registration screen K in which details on a requestreceived from a client is reflected, and delivers the bid registrationscreen K, such that those who access the screen K can view the auction,to solicit a participation in a bid for an article or service offered bythe client. The server 21 widely collect bids on terminals 30 of thirdparties through the Internet N. In this event, if the auction isconducted for an article or a service available from particular dealers,the server 21 transmits bid collection information only to suchparticular dealers.

In S2060, it is determined whether or not a bid collection is specified.Specifically, when the bid collection “YES” is set in the options E6 anda bidding period is set in the entry field E7 on the requestregistration screen E, bidders are collected during the bidding period.Since some article or service is not suitable for a bid, the contents ofwhich is changed according to the details on the request, when viewed,articles or services are narrowed down to those that most satisfy therequirement from previously registered data if such a type of article orservice is traded at auction. On the other hand, when an article or aservice is suitable for a bid, the contents of which is determined afterdetails on a request is viewed and considered, bidders who offerconditions and so on that satisfy requirements are collected during thebidding period. It should be noted that a procedure of starting theauction to display the bid registration screen K on the terminals 30 ofbidders in S2050 and receiving bid information at servers 21 in S2060when there is an application, corresponds to a bid procedure.

In S2070, it is determined whether or not any application is made to theauction. In other words, the presence or absence of a bid from a bidderis determined. In this event, the presence or absence of the bidregistration data D19 is determined when the client has specified the“direct trade,” while the presence or absence of the bid informationdata D20 is determined when the client has specified the “informationtrade.” If there is no bid, the server 21 waits for bids. If there is abid, the procedure flow continues to S2080. It should be noted that aprocedure executed from S2070 to S2170 corresponds to a bid acceptanceprocedure.

In S2080, bid information is acquired to execute the bid processingwhich involves evaluating each of evaluation items in the form ofnumerical value based on a variety of data for evaluation which has beenoffered as one piece of information within the bid information, summingthe respective numerical values to produce a total evaluation numericalvalue, and conducting the bid with the total evaluation numerical value.Bidders are ranked in a priority order in which positioned at a higherrank is a bidder who is given a greater total evaluation point which isderived by summing respective numerical values representative ofevaluations for respective evaluation items for the contents of offersof the bidders.

In S2090, it is determined whether or not a limited time has expired.When within the limited time, the procedure flow returns to S2070 torepeat the processing from S2070 to S2090 to execute the bid processingeach time a new bidder applies, until the limited time expires. At theexpiration of the limited time, the procedure flow continues to S2120.

On the other hand, if it is determined in S2060 that the bid collection“no” is specified, bid information is collected in S2100. Specifically,the bid registration data D19 or the bid information data D20 previouslymanaged as databases in the DBs 145, 147 are searched to extractpreviously registered articles or services pertinent to the specifiedarticle or service.

Then, in next S2110, the bid processing is executed for the extractedarticles or services with evaluation numerical value. Specifically,articles or services offered by the respective bidders are evaluated inthe form of numerical value for evaluation items (key words or the like)identified from the requirements of the client, and are narrowed down tothose which are given a total evaluation point, the sum of evaluationnumerical values for the respective evaluation items, that mostsatisfies the requirements of the client.

In S2120, it is determined whether or not a bid-off self selection isset. The procedure flow continues to S2150 when the bid-off selfselection is not set, and to S2130 when the bid-off self selection isset.

In S2150, it is determined whether or not a successful bidder isdetermined. In other words, it is determined whether bidders arenarrowed down to a predetermined number of successful bidders. Theprocedure flow continues to S2160 if the bidders are not narrowed downto the predetermined number of successful bidders, and otherwise toS2170.

In S2160, the narrow-down processing is executed. Bidders are narroweddown to a predetermined number of potential successful bidders inconsideration of other reference information other than evaluationnumerical values. A bidder who has offered conditions or the like thatmost satisfy the requirements of the client is determined as asuccessful bidder. On the other hand, if a price is fixed or if a priceitself is not handled in a bid, successful bidders are narrowed down toa predetermined number in accordance with a previously definedpredetermined rule.

On the other hand, if it is determined in S2120 that the bid-off selfselection is set, the evaluation result display screen O, which listsbid information provided by a predetermined number of successfulbidders, illustrated in FIG. 54 is created. The user can view theevaluation result display screen O by selecting a screen display afterentering a password on the screen of the terminal 30. The evaluationresult display screen O enumerates candidate items (articles/services)or candidate persons in a priority order in which candidates givengreater total evaluation points are ranked at higher places.

In S2140, it is determined whether or not a successful bidder has beendetermined. The evaluation result display screen O is continuouslydisplayed (S2120) until a successful bidder is determined, and theprocedure flow continues to step S2170 when a successful bidder isdetermined. The client determines a trading partner while referencingindividual evaluation points for the respective evaluation items as wellas the total evaluation points and further referencing other informationoffered by the bidders. On the screen O, the bid-off button 175 isdisplayed as selected at a position corresponding to an article (or aservice) at the first place of the candidate ranking. When the clientwants to individually view an evaluation point for each key word andchanges an article to be bidden off to an article at a lower rankcandidate, the client may select a right end position corresponding tothe article to switch the position at which the bid-off button 175 isselected to the position of the selected article. On the other hand, fora correction or a cancel, a correction button 177 may be selected. Whenthe client eventually determines a trading item (trading partner, anarticle or a service) after changing the selection of the bid-off button175 as required on the screen O, the client selects the OK button 176.In response, the associated bid-off data is transmitted to the server 21through the Internet N, which determines that a successful bidder hasbeen determined, followed by the procedure flow continuing to S2170.

In S2170, the server 21 notifies both the user and the successful bidderof the establishment of the trade.

Next, a procedure of the evaluation auction will be explained withreference to a flow chart of FIG. 58. This procedure is used when a bidis conducted with evaluation numerical values in the flow chart of FIG.57. It should be noted that a procedure shown in S3010 to 3070 alsoconstitutes a bid-off procedure.

In S3010, the server 21 collects the evaluation data D21 (FIG. 55)associated with an article or a service (including a provider).

In S3020, the server 21 acquires an equation for a key word.Specifically, the server 21 searches the equation data D22 with the keyword to acquire an equation corresponding to the key word.

In S3030, evaluation items corresponding to variables used in anequation for each key word are searched to acquire an evaluation pointfor each evaluation item.

In S3040, the evaluation points for the evaluation items are substitutedinto the variables in the equation for the key word to calculate anevaluation point for the key word.

In S3050, an evaluation percentage is acquired for each key word. Whenrequirements are registered as key words, an evaluation percentagedetermined from a priority order is employed in “priority orderregistration”; an evaluation percentage specified by the client isemployed in “evaluation percentage registration”; and a predefinedevaluation percentage (for example, an equivalent evaluationpercentage), which has been initially set, is employed in “predefinedregistration”. On the other hand, when the requirements are entered as asentence, an evaluation percentage specified to each of key words fromthe result of an analysis on the sentence is employed.

In S3060, the evaluation point for each of the key words is multipliedby each evaluation percentage associated therewith, and the resultingvalues are accumulated to calculate a total evaluation point.

In S3070, the result of the evaluation is displayed on the screen. Inthis event, the evaluation points given to items offered by respectivebidders are compared to draw up the bidders (or offered articles orservices) in order. In this event, a range of points is determined inaccordance with the level of the requirements registered by the clienton the request registration screen E, so that the bidder who has beengiven the highest total evaluation point, for example, within the rangeof points is determined as a successful bidder.

Next, several examples for the evaluation auction will be enumeratedbelow.

(A) Desired conditions and the degree of satisfaction of a buyer isevaluated, such that a seller who has offered the conditions/contentswhich are given the highest value, or information on the seller isselected at auction.

(1) A judge or a buyer evaluates the novelty or inventive step,performance, usability and functions, notability and favorability,price, design, and so on of an article or a product, a machine, afacility, a system, design drawings, a design, a patent or the like, ordesired condition, degree of satisfaction or the like of the judge orthe buyer, and selects an item which was given the highest point for anindividual numerical value or a combination of all the numerical values,or information on the item at auction.

(2) A judge or a buyer evaluates locality, characteristics, valuability,distribution, notability, quality, quantity, price, preservation, color,shape, and so on of a fuel, a raw material, an agricultural product, amarine product, a forest product, a processed item, a product, anarticle, or the like, or desired condition, degree of satisfaction orthe like specified by the judge or the buyer, and selects an item whichwas given the highest point for an individual numerical value or acombination of all the numerical values, or information on the item atauction.

(3) A judge or a buyer selects an answerer, an examinate, a player, aperformer, a man of ability or the like which has acquired the highestpoint, or information associated therewith at auction.

(4) A judge or a buyer evaluates the figure, sense, style, fashion,singing ability, playing ability, dance ability, force, vitality, skill,conversational skill, intellectual ability, notability, or the like, ordesired conditions, degree of satisfaction, evaluation of theperformance, or the like specified by the judge or the buyer, andselects a client, a seller or an evaluated person which was given thehighest point for an individual numerical value or a combination of allthe numerical values, or information on the item at auction.

(5) A financier, an investor, or a judge evaluates the sales amount,revenue, contents of closing accounts, capital force, possessedtechnological specialties, development capabilities, futurecapabilities, number of employed persons, expenditure, asset,creditability, or the like of an individual or a legal person, orconditions specified by the financier, the investor or the judge, andselects an item which was given the highest point for an individualnumerical value or a combination of all the numerical values, orinformation on the item at auction.

(6) A judge or an information provider, or a buyer of a company, anindividual, an association, an organization, a nonprofit institution, acredit company, an Internet company, a public organization, a servicecompany or the like evaluates a paying ability and results, a purchaseability and result, creditability, fortune, education, profession,professional history, age, avocation, skill, title, native place andaddress, membership history, or the like of an ordinary customer,client, member, employee or the like, or conditions specified by thejudge or the buyer, and selects an item which was given the highestpoint for an individual numerical value or a combination of all thenumerical values, or information on the item at auction.

(7) When a judge or a buyer is going to learn at a school, a drivingschool, or a training school for acquiring a title, or a sport, music,picture, language, skill or cultural class, or with a home tutor or thelike, the judge or the buyer evaluates a school fee, required period foracquiring a title, time required to reach the class and transportationmeans, higher grade school entrance and recruiting accomplishment,experiences and evaluations by learned students, environment, equipment,facilities and so on of the class, or the like, or conditions, degree ofsatisfactory, or the like specified by the judge or the buyer, andselects an item which was given the highest point for an individualnumerical value or a combination of all the numerical values, orinformation on the item at auction.

(8) When a judge or a buyer is going to make an order to a carpenter ora construction or a facility company, a house reform company, or aplate, paint or repair company for a car, a machine or the like, arepair company for a business machine, dairy necessities or the like, atransportation company for movement, delivery or the like, an on-demandproduction company, or the like, the judge or the buyer evaluates aprice, a fee and a payment method, the number of days required forproduction, repair and mending, a service period and a range ofinsurance of the after service, time and distance to the house or theoffice of a contractor, evaluations of customers for a seller and workresults, the skill and personal evaluation of a contract, and so on, orconditions, degree of satisfactory, or the like specified by the judgeor the buyer, and selects an item which was given the highest point foran individual numerical value or a combination of all the numericalvalues, or information on the item at auction.

(B) A seller evaluates desired conditions, and selects a buyer who hasoffered the highest numerical value or information on the buyer atauction.

(1) When an information provider or a seller sells, rents, or sellsinformation on a transportation means such as a car, a ship, anairplane, a rocket or the like, an article, a product, a machine, afacility, a system, a building, a land, engineering, a design, acopyright, a patent, or the like, or sells a fuel, a raw material, anagricultural product, a marine product, a forest product, a processeditem, or the like, or sells information associated therewith, theinformation provider or the seller evaluates a sales price, a lease fee,the quantity, a weight, an order and a delivery due date, a use period,an order date and an order place, a use day and a use place, the numberof times of uses, a delivery place, the distance, a method, or the like,or conditions of the seller or the information provider, and selects anitem which was given the highest point for an individual numerical valueor a combination of all the numerical values, or information on the itemat auction.

(2) A client or a job hunter evaluates a salary, treatments, weeklyholidays, annual holidays, the established year of a company, a capital,the number of employees, a constitutional organization, welfarefacilities, environment, site conditions, facilities, types of works,settlements, trading companies, or the like, or result, a method ofemployment, contents of course, a course fee, a period, a system, or thelike, or conditions desired by the client or the job hunter, orconditions of an information provider, and selects an item which wasgiven the highest point for an individual numerical value or acombination of all the numerical values, or information on the item atauction.

(3) A person who receives an investment, a finance or informationevaluates a financed amount, a finance execution date, an interest, apayment period, the number of times and the amount of commission, acollateral rate, the presence or absence of a guarantor offered by abank, a credit company, a financial dealer, an investor, or aninvestment company, or notability, creditability or the like of afinance company or an individual, or the like, or conditions desired bythe person who receives an investment or a finance, or conditions of aninformation provider, and selects an item which was given the highestpoint for an individual numerical value or a combination of all thenumerical values, or information on the item at auction.

(C) A buyer evaluates desired conditions or degree of satisfaction, andselects a seller who offers the smallest numerical value or informationassociated therewith at auction.

(1) When a judge or a buyer selects an article or a product, a car, aship, an airplane, a rocket, a machine, a facility, a patent, or thelike, the judge or the buyer evaluates used years, manufactured year,price, degree of repairs, abrasion, corrosion, deformation,discoloration, noise environment contamination degree, or the like, orconditions specified by the judge or the buyer, or the result ofexaminations, and selects an item which was given the smallest point foran individual numerical value or a combination of all the numericalvalues, or information on the item at auction.

(2) When a judge or a buyer selects an agricultural product, a marineproduct, a forest product, a processed item, a product, an article, orthe like, the judge or the buyer evaluates the quantity, a weight, aprice, or defects or difficulties such as wounds, damaged freshness orthe like, or conditions specified by the judge or the buyer or theresult of examinations, and selects an item which was given the smallestpoint for an individual numerical value or a combination of all thenumerical values, or information on the item at auction.

(3) A judge or a buyer selects an answerer, an examinate, a player, aperformer, a man of ability or the like which has offered the smallestnumerical value with respect to erroneous answers, a lost point, defectsor the like, or information associated therewith at auction.

(4) A judge, a financier, an investor, a service company or the likeevaluates ages of employees, a percentage of part-time workers, a loanratio, an asset ratio, a personnel expense ratio, a bill issuing ratio,the number of times of delayed payments, the number of times ofaccidents, or the like, or conditions specified by the judge or thelike, or the result of examinations, and selects an item which was giventhe smallest point for an individual numerical value or a combination ofall the numerical values, or information on the item at auction.

(5) When a judge or a buyer selects a fuel, vinyl, plastic, a wrappingproduct, a container, dairy necessities, electric appliance, furniture,clothing, a raw material, an intermediate product, an article or thelike, the judge or the buyer evaluates CO₂, poisonous gases, emissionregulated substances or the like, which are generated when they areburnt, or the amount of substances, generated by burnt, specified by thebuyer or the judge, and selects an item which was given the smallestpoint for an individual numerical value or a combination of all thenumerical values, or information on the item at auction.

(6) When a judge or a buyer selects a machine, an apparatus, anintermediate product, an article, an agricultural product, a marineproduct, a forest product, a processed food, or the like, a system,design drawings, a patent or the like, the judge or the buyer evaluatesthe amount of mixture or use of a gas, water, a solvent, a detergent, afoaming agent, a redox agent, a corrosive, a coloring agent, adisinfectant, agricultural chemicals, oil, a mixing agent, or the like,or a substance specified by the judge or the buyer, and selects an itemwhich was given the smallest point for an individual numerical value ora combination of all the numerical values, or information on the item atauction.

(7) When a judge or a buyer selects a car, a ship, an airplane, a train,a rocket, a machine, a facility, an atomic power plant, or the like, thejudge or the buyer evaluates the amount of emission of exhausted gases,emission regulated substances or the like such as radiation, CO₂ gas,nitrogen, phosphate compounds, or the like, or a substance specified bythe buyer or the judge, and selects an item which was given the smallestpoint for an individual numerical value or a combination of all thenumerical values, or information on the item at auction.

(8) When a judge or a buyer selects a factory, a company, an apparatus,a facility, an atomic power generator, design drawings, a system, apatent, or the like, the judge or the buyer evaluates the amount ofemission of radiation, CO₂ gas, poisonous substances, emission regulatedsubstances, or the like, or a substance specified by the judge or thebuyer, and selects an item which was given the smallest point for anindividual numerical value or a combination of all the numerical values,or information on the item at auction.

(9) When a judge or a buyer selects a system, design drawings, a patent,a machine, a facility, a factory, a company, a product, or the like, thejudge or the buyer evaluates the amount of emitted radiation, gases,liquids, solids, or the like, and selects an item which was given thesmallest point for an individual numerical value or a combination of allthe numerical values, or information on the item at auction.

(10) When a judge or a buyer is going to learn at a school, a drivingschool, or a title acquisition class, or a skill, language, sport,music, picture, or cultural class, or with a home tutor or the like, thejudge or the buyer evaluates problems on a school fee, required periodfor acquiring a title, the distance to the class or the school, or thelike, or conditions specified by the judge or the buyer, and selects anitem which was given the smallest point for an individual numericalvalue or a combination of all the numerical values, or information onthe item at auction.

(11) When a judge or a buyer is going to make an order to a carpenter ora construction or a facility company, a house reform company, or aplate, paint or repair company for a car, a machine or the like, arepair company for facilities, institutions, companies, businessmachines, dairy necessities or the like, a transportation company formovement, delivery or the like, an on-demand production company, or thelike, the judge or the buyer evaluates problems on a price, a fee, thenumber of days required for production, repair and mending, time anddistance to the house or the office of a contractor, or the like, orconditions specified by the judge or the buyer, and selects an itemwhich was given the smallest point for an individual numerical value ora combination of all the numerical values, or information on the item atauction.

(D) A seller evaluates desired conditions, and selects a buyer who hasoffered the smallest numerical value, or information on the buyer atauction.

(1) When a seller sells industrial wastes, recovered or second handproducts, raw materials, intermediate products, or the like, or requestsprocessing thereof, a buyer evaluates the amount of generation oremission of CO₂ gas, emission regulated gases, poisonous gases,contaminated water, contaminated substances, emission regulatedsubstances, waste water, or the like which are generated or emitted froma factory, a machine or a facility at stages of processing, repair, andworking, or a substance specified by the seller, and further evaluates asales price, repair, work, processing fee, a period and techniquesrequired therefor, or the like, or conditions desired by a judge or theseller, and selects an item which was given the smallest point for anindividual numerical value or a combination of all the numerical values,or information on the item at auction. It should be noted that the priceand fee are not included when the above items are evaluated withindividual numerical values.

As appreciated from the foregoing, the following advantages are providedaccording to the sixth embodiment.

(13) With the employment of an auction system in which a bid isconducted with evaluation points which are evaluated in the form ofnumerical values by a client for requirements to bid off an article, aservice, or a buyer, the client can find a trading partner who satisfiesthe requirement of the individual client.

(14) Since a bid form can be selected from a plurality of bid forms, itis possible to find a trading partner who most satisfies requirements ofa client.

(15) Since requirements of a client are evaluated in the form ofnumerical value such that an auction is conducted to compete theevaluated numerical value, abstract requirements (degree ofsatisfaction, future, potential growth, usability, key word, and so on)which cannot be replaced with physical amounts can be auctioned to tradethe provision of an article or a service which most satisfies therequirement by auction.

(16) Upon receipt of a request for acquisition of information from aclient, the server widely promotes third party through the Internet N toprovide the requested information, conducts a bid for a certain elementwithin the contents of provided information in such a manner that theclient selects an information provider (bidder) who offered contents ofinformation that most satisfies the requirements of the client as asuccessful bidder. It is therefore possible to acquire most appropriateinformation as to how one can be provided with a desired article orservice even if a provider or a providing company of such article orservice does not participate in the auction. Particularly, a fishingboat may provide a nearby fishing boat or the like with information onsigns of fish which is not a target of the fishing boat itself but maybe intended, for example, by other fishing boats, other than fish whichis captured by the fishing boat, thereby making it possible toeffectively use information which is valuable for other persons viewedfrom the third parties.

Seventh Embodiment

Next, a seventh embodiment which embodies the present invention will bedescribed with reference to FIGS. 1 through 3, 15, 16, 18, 59 through69. While in the respective embodiments described above, a bid isconducted to compete a time or a trading due date, a position, anumerical value, an evaluation numerical value, and so on, the seventhembodiment allows for a selection from a plurality of elements includingthe time and position, as elements other than the price, as well as thetime and position. More specifically, a bid may be conducted to competea time, a position (including on the move), a space (length or thelike), a quantity, a weight, a numerical value, and so on.

The general configuration of an auction system in the seventh embodimentis basically similar to those described in the respective embodiments inconnection with FIGS. 1 and 15. Also, the functional configuration issubstantially similar to those illustrated in FIGS. 2 and 16, exceptthat the auction system of the seventh embodiment can support multipleelements as well as the time and position and therefore comprises anincreased amount of databases corresponding to the respective elements.

A bid may be conducted to compete time, position, space, quantity,weight, numerical value, and so on. An auction home page is similarlyprovided for showing an entire menu corresponding to those of FIGS. 3and 18. Upon selecting the field of articles/services on the HP screenand then selecting specifically an article or a service on a lower levelscreen, an element selection screen JA illustrated in FIG. 59 isdisplayed. The element selection screen JA is provided with options JA1for selecting an auction or a counter-auction (which may not be selectedif it has been selected on the previous screen), element selectionbuttons 180 to 186 including “time”, “position”, “on the move”,“length/space”, “number/quantity”, “weight”, and “numerical value”, anda decision button 187.

A program is created to allow the user to select a suitable element inaccordance with an article or a service to be traded, and is stored in amemory of a server 21. FIGS. 68 and 69 illustrate the program in theform of flow chart, wherein an element selected by the user is basicallycompeted in a bid, not limited to the time in the program illustrated inthe first embodiment. Of course, “PRICE” may be included as an elementof a bid in addition to the elements shown in FIG. 59. It should benoted that the screen JA of FIG. 59 and a bid form selection screen IAillustrated in FIG. 60, which will be described later, correspond torequest screens, and contents of data entered on these request screenscorrespond to bid request information.

Similar to the first embodiment, a slide system is provided for the bidform. Specifically, since either of elements such as time, position,space, quantity, weight, numerical value and so on can be represented ona coordinate axis as a numerical value, a reference value is specifiedon the coordinate axis such that a numerical value closer to thereference value is preferentially selected as a successful bid, a valuefurther away from the reference value is preferentially selected as asuccessful bid, and so on. Five types of such rules are set as bid formsfor determining a successful bid.

FIG. 60 illustrates the bid form selection screen IA for selecting a bidform. The bid form selection screen IA is provided with anarticle/service display field IA1, an element display field IA2, bidform selecting options IA3, a reference value entry field IA4, anapproaching direction selecting options IA5, a range entry field IA6,and a transmission button 188. In the bid form selecting options IA3,one is selected from three options including an option for specifyingthat a smaller value is given a higher priority; an option forspecifying that a greater value is given a higher priority; and anoption for specifying that a value closer to a specified reference valueis given a higher priority. The approaching direction selecting optionsIA5 are provided for specifying from which direction, a reference value,if specified, is approached. One is selected from three optionsincluding an option for specifying an approach from a smaller value tothe reference value; an option for specifying an approach from a greatervalue to the reference value; and an option for specifying an approachfrom both directions to the reference value. The range entry field IA6is provided for specifying a range, wherein one of an upper limit and alower limit may only be specified, or no range may be specified. Itshould be noted that the reference value corresponds to a desired value.

FIGS. 62A through 62D are diagrams for explaining four of the five bidforms. When each element is represented by a numerical value, thenumerical value may be classified into concepts of incremental valuesand concepts of decremental values. For example, far, larger, wide,long, heavy, and so on are concepts of incremental values, while near,small, narrow, short, light and so on are concepts of decrementalvalues. The bid form refers to the rules as to whether the largest oneof offered numerical values and so on is determined as a successful bid;or whether the smallest one is determined as a successful bid; orwhether a value coincident with or closest to a reference valuespecified by a customer is determined as a successful bid. There are thefollowing five types of bids. It should be noted that these forms arenot set in a numerical value auction, later described.

(1) A priority rule which preferentially determines a person who offersthe smallest numerical value within a predetermined range as asuccessful bidder (FIG. 62A).

(2) A priority rule which preferentially determines a person who offersthe greatest numerical value within a predetermined range as asuccessful bidder (FIG. 62B).

(3) A priority rule which preferentially determines a person who offersthe value that most approaches to a reference value of a specifiedelement from the smaller value side as a successful bidder (FIG. 62C).

(4) A priority rule which preferentially determines a person who offersthe value that most approaches to a reference value for a specifiedelement from the greater value side as a successful bidder (FIG. 62D).

(5) A priority rule which preferentially determines a person who offersa closest possible value to a reference value for a specified elementany way irrespective of whether it is from the smaller value side orfrom the greater value side with respect to a specified numerical value.It should be noted that while in the rules (3) to (5), a valuecoincident with the reference value is most preferred, the value closestto the reference value, not including the reference value, may bepreferred.

Alternatively, a plurality of elements may be selected on the elementselection screen JA of FIG. 59. When two or more of the plurality ofelement selection buttons 180 to 186 are selected, an element priorityorder setting screen WB illustrated in FIG. 63 is displayed. The elementpriority order setting screen WB is provided with entry fields WB1 toWB4 for specifying a maximum of n numerical values for a first priority,a second priority, . . . , an n-th priority (in this example, n=4), anda decision button 191. Elements of the first priority, the secondpriority, the n-th priority can be specified, and the priority order ofthe specified elements can be set freely by the user. A price may be setto a value of the second priority or lower. A plurality of elements canbe set in this way because only the position, for example, selected asan element is not sufficient to narrow down to a predetermined number ofsuccessful bidders (generally one) in some cases, and are used todefinitely narrow down bidders to a desired number of successful bidder.A client registers the order of preferred elements. Then, as the clientselects the decision button 191 on the screen WB, priority conditiondata Db is transmitted to the server 21.

Information may be traded as an article. Specifically, when a certainarticle or service is desired, the auction is used for a trade to buyrequired information from the owner of the article, a company whichsells the article, or a person who knows about a provider or a providingcompany of the service.

Traded information may be in any fields and categories. Giving a mereexample, there are information on signs of fish (about what time whichkind of fish in which region and at which density of signs of fish)information on resources (information on where rare metals, petrol, orthe like is buried), and so on.

An example of handling information on signs of fish in a positionauction will be explained below. For example, a fishing boat may providefishermen and fishing boats with information on signs of fish which isnot a target of the fishing boat itself but may be intended, forexample, by other fishing boats, other than fish which is captured bythe fishing boat. In this event, fishing boats and so on which expectsuch information generally want information on signs of fish nearestfrom them. For this purpose, these fishing boats may participate in theposition auction to acquire information from the nearest ship.Specifically, a ship who has information on signs of fish provides theinformation to the server 21 of an intermediary company through theInternet N. For example, fishermen and fishing boats may use theposition auction to look for any useful information on the fishing fromnearby ships. In this event, it is possible to narrow down informationby entering the kind of fish in the priority entry field. Also, apositional range may be narrowed down.

The server 21 widely provides terminals 30 of third parties with such anoutline of information that let the third parties understand to whichthe information is related to, so that a third party which views theoutline buys the information through the terminal 30.

For example, as illustrated in FIG. 18, the auction HP screen isprovided with an information entry button 89 and an information tradebutton 90. When the information entry button 89 is selected on thisauction HP screen, an information provision screen NC illustrated inFIG. 61 is displayed. The screen NC is provided with a collectedinformation display field NC1, an information fee (compensation forproviding information) display field NC2, an information entry fieldNC3, an information attachment button 189, a remaining time displayfield NC4, an ID number entry field NC5, and a transmission button 190.The information provision display NC is a screen which is displayed whena viewer selects an item, which the viewer wants to view, from aninformation collection list displayed for each of categories/fields uponselection of the information entry button 89 on the home page screen. Onthe information provision screen NC, the collection information displayfield NC1 displays the contents of information which a client is lookingfor, and the information fee display field NC2 displays an informationfee, so that a view who can provide the wanted information enters(fills) the provided information in the information entry field NC3, orattaches data by performing manipulations associated with the attachmenton the next screen which is displayed when he selects the append button189, enters his ID number, followed by transmission of the information.The information is managed by the server 21 in the database 24. Itshould be noted that the information provision screen NC comprises a bidscreen.

For example, when information desired by a user is transmitted to theserver 21, the server 21 searches managed data in the database 24 forpertinent information, and immediately collects the information when theinformation is not urgently required so that a collection time isallowed to some extent. Then, after the expiration of a limited time,i.e., a remaining time has been exhausted, collected information isanalyzed to transmit information which most matches the needs of theclient to a terminal 30 of the client. In this event, the client canselect and specify one of the aforementioned bid forms, so that asuccessful bidder is determined in accordance with the rule of thespecified bid form. The client who has acquired the desired informationpays the information fee and an additional commission. The informationfee is paid to the successful bidder. It should be noted that in thisembodiment, an auction or a counter-auction is selected using theoptions JA1 on the screen JA illustrated in FIG. 59, rather thanselecting an auction system by selecting the button 51 or 52 on the HPscreen of FIG. 18. Also, this embodiment is provided likewise with ascreen substantially similar to the bid registration screen Killustrated in FIG. 52 of the sixth embodiment, so that a bidder mayenter required items on the screen K, and the entered bid information istransmitted to the server 21.

As a result of an auction, information on a single successful bidder isbasically transmitted to the client. However, if the client wishes, aplurality of narrowed down candidates may be presented, as illustratedin a list screen XD of FIG. 64. Specifically, the server 21 createsinformation offered by bidders, as it is, into a list, or creates apriority list by narrowing down successful bidder candidates of higherpriority levels, for example, into a limited number specified by theclient, based on information offered by bidders, and transmits thecreated list to the terminal 30 of the client. Then, the list XDillustrated in FIG. 64 is displayed on the terminal 30 of the client.The screen XD is provided with a list XD1, an entry field XD2 forselecting a successful bidder, and a decision button 192. The list XD1indicates a priority number, a code number, and an element numericalvalue (values representative of time, position, space, weight,evaluation and so on), and conditions offered by a bidder (price,supplementary items (extra) and so on). The client reviews the offeredconditions such as a trading date from the list XD1 on the screen XD todetermine a bidder favorable for him as a successful bidder, enters, forexample, the priority number of the winning bidder in the entry fieldXD2, and selects the decision button 192. In response, the server 21notifies the client and the successful bidder of the successful bid.When the list XD1 can be viewed on the terminal 30 of the client in thisway, the client can select a partner which offers favorable conditionsin terms of another element such as the price, in addition to aspecified element, if a plurality of bidders offer the same elementnumerical value, or can select a partner who may concede in the price,supplementary items and so on, even if the partner offers an elementnumerical value slightly worse than the first bidder.

When the element selection button 186 “numerical value” is selected onthe screen JA of FIG. 59, a numerical value auction is conducted. Thenumerical value auction refers to an auction trade in which an articleor a service desired by a client is evaluated in the form of numericalvalue whether or not the article or the service satisfies requirementsof the client, and from a large number of articles and services whichhave been previously registered, or collected each time a request ismade, an evaluation point (numerical value) about an article or aservice, or an object or a person who serves for the service, which isgiven the highest evaluation point as a result of evaluation, isdetermined as a successful bid.

A client offers a desired article or service, and identifies specificrequirement, if any, by selecting such requirement from previouslyprovided key words. Likewise, in this embodiment, the screens LA, LB, LCillustrated in FIGS. 49, 50, 51 are provided for the client to enter hisrequirements. Screen data for these screens are stored in the memory ofthe server 21. It should be noted that the screens LA to LC alsocomprise request screens.

The request registration screen LA of FIG. 49 is provided with anarticle/service display field 166, entry fields LA1 to LAn for enteringa maximum of n key words, associated with important aspects for anarticle or a service desired by the client, for a first priority, ann-th priority in a priority order of importance.

The request registration screen LB of FIG. 50 is provided with anarticle/service display field 166 similar to that in FIG. 49, entryfields LB1 to LBn for entering key words with a first priority to ann-th priority, and evaluation percentage entry fields 168 for specifyingan evaluation percentage (%) in accordance with the ratio of importanceof respective key words.

The request registration screen LC of FIG. 51 is provided forregistering key words for which no priority order is given in particularor to which a predefined priority order, which has been initially presetby a program, is applied. This screen LC is provided with evaluationitem entry fields LC1 to LCn for entering a maximum of n key words.

Alternatively, an article or a service may only be offered, in whichcase the server 21 stores evaluation data for properly evaluatingpreviously registered articles or services, evaluates a plurality ofpreviously determined evaluation items in the form of numerical values,and determines an article or a service which is given a high totalevaluation point as a successful bid.

This embodiment also comprises the data 21, 22 shown in FIGS. 55 and 56.FIG. 55 shows evaluation data 21 which records an evaluation point foreach of evaluation items associated with articles and services, whereinan evaluation point for each of evaluation items is recorded for each ofregistered articles A, B, C, . . . . In this example, the articles areevaluated on the basis of 100 points.

FIG. 56 shows equation data 22 which records equations for use inconverting a key word into a numerical value, wherein a correspondingequation is recorded for each key word. Variables in the equationscorresponds to evaluation items, so that an evaluation point iscalculated for a key word by substituting evaluation points ofevaluation items corresponding to the respective variables in theequations and calculating the equations.

For example, for looking for a food through the numerical value auction,when evaluation items include key words such as “safety”, “healthful”,“disease”; and so on, by way of example, these requirements are totallyand properly evaluated for conversion into an evaluation point. To eachkey word, an equation has been previously set such that the key word iscorrectly evaluated. For example, with “SAFETY”, evaluation items usedas variables of an associated equation includes a natural vegetableusing ratio, a synthetic seasoning using ratio, a sugar using ratio,agricultural chemicals/fertilizers, minerals, and so on, each of whichis given a greater point as an associated food is more healthful to ahuman body. For example, an equation “Σkn (=k1+k2+ . . . +kn)” (where knis an evaluation value for an evaluation item n). In this way, anevaluation point is found in accordance with a key word based on theevaluation data 21 and the equation data 22. With “disease,” in turn, anequation is employed such that an evaluation item (for example, acomponent such as a vitamin or the like) more effective for curing thisdisease is more highly weighted. A food which is given a high point tothe effective evaluation item is properly evaluated so that itsevaluation point for the key word “disease” basically becomes greater.For example, for diabetes, an equation is employed such that anevaluation point for a sugar percentage is more highly weighted, so thata food with a low sugar percentage is extremely highly evaluated forthis key word. The respective data 21, 22 are stored, for example, inthe database 24.

For example, when a client uses the request registration screen LA ofFIG. 49 for setting a plurality of key words, evaluation points forrespective key words of the first priority to the n-th priority areweighted in the priority order, so that requirements of the client aretotally evaluated. For example, a total evaluation point is calculatedin accordance with its predefined evaluation percentage, for example,100% for the first priority, 80% for the second priority, . . . , 10%for the n-th priority, and so on. When the request registration screenLB of FIG. 50 is used, evaluation points for respective key words of thefirst to the n-th priority are weighted in accordance with correspondingevaluation percentage % to calculate a total evaluation point. When therequest registration screen LC of FIG. 51 is used, respective key wordsare equivalently evaluated, i.e., evaluated with weights in accordancewith predefined ratios. The customer request registration screens arenot limited to the foregoing, but alternatively, requirements may beentered in the entry field, for example, as a sentence, such that thesentence is analyzed to automatically assign appropriate key words forthe requirements. It should be noted that requirement data (for example,key words and so on) from the client, which is information that is thebasis for conversion into numerical values such as evaluation points forindividual items and a total evaluation point correspond to informationunder evaluation.

Also, this embodiment comprises the evaluation result display screen Oillustrated in FIG. 54 as well. For example, when a client sets aplurality of key words, candidate articles (or services) which satisfyrequirements are displayed in the order of greater total evaluationpoints as illustrated in FIG. 54. On this screen O, an individualevaluation point for each evaluation item (key word) and a totalevaluation point are displayed for the respective articles (or services)selected as candidates.

On the screen O, a bid-off button 175 at a position corresponding to anarticle (or a service) ranked at the first position as a successful bidcandidate is displayed as selected. When the client wants toindividually view an evaluation point for each key word and changes anarticle to be bidden off to an article at a lower rank candidate, theclient may select a right end position corresponding to the article toswitch the position at which the bid-off button 175 is selected to theposition of the selected article. For a correction or a cancel, acorrection button 177 may be selected. Then, the client selects an OKbutton 176 when he determines an article to be bidden off. In response,the associated bid-off data is transmitted to the server 21 whichnotifies both the seller and the buyer of the establishment of thetrade.

Next, an auction procedure will be explained with reference to a flowchart of FIG. 65.

First, in S4010, an article or a service is selected.

In S4020, an element (time, position, space, numerical value, or thelike) is selected for conducting a bid. It should be noted that aprocedure of receiving bid request information at the server 21 inS4020, S4030 corresponds to a request procedure.

In S4030, desired conditions (required items such as a bid form, arange, a bidding period and so on) are selected.

In S4040, an element auction is started. Here, the server notifies aplurality of terminals of a collection of bidders to promote potentialbidders to participate in the auction.

In S4050, it is determined whether or not any application is made to theauction. In other words, the presence or absence of a bid from a bidderis determined. If there is no bid, the server 21 waits for bids. Ifthere is a bid, the procedure flow continues to S4060. It should benoted that a procedure of starting the auction to display a screen forbidding on terminals of bidders in S4040 and receiving bid informationentered when a bid is applied in S4050 at the server 21 corresponds to abid procedure, and a procedure executed from S4050 to S4160 correspondsto a bid acceptance procedure.

In S4060, bid information offered by bidders is acquired to execute thebid processing with an element which has been offered as one piece ofinformation within the bid information. If a plurality of elements areselected and set, the bid is conducted with an element of a firstpriority. Then, in comparison with the desired conditions (the priorityrules shown in FIGS. 62A through 62D) in terms of the element(s) withinthe bid information, a priority order is determined for bidders.

In S4070, it is determined whether or not a limited time has expired.When within the limited time, the procedure flow returns to S4050 torepeat the processing from S4050 to S4070 to execute the bid processingeach time a new bidder applies, until the limited time expires. At theexpiration of the limited time, the procedure flow continues to S4080.

In S4080, it is determined whether or not a bid-off self selection isset. The procedure flow continues to S4090 when the bid-off selfselection is not set, and to S4140 when the bid-off self selection isset.

In S4090, it is determined whether or not a successful bidder isdetermined. In other words, it is determined whether bidders arenarrowed down to a predetermined number of successful bidders. Theprocedure flow continues to S4100 if the bidders are not narrowed downto the predetermined number of successful bidders, and otherwise toS4160.

In S4100, it is determined whether there are any remaining elementswhich have not been processed for the bid, when a plurality of elementsare set. The procedure flow continues to S4110 if there are stillremaining elements, and otherwise to S4130.

In S4110, a current element is replaced with another one.

In S4120, the bid processing is executed with the replaced element tonarrow down bidders to a predetermined number of successful bidders. Thebidders are narrowed down to the predetermined number of successfulbidders by comparing the other element (of the second priority) withinthe bid information with the desired conditions (the priority rulesshown in FIGS. 62A through 62D). If the bidders cannot be narrowed downeven with this bid processing, the current element is replaced withanother element of the next priority if there are still other elementswhich have not yet been used in the bid processing to narrow down thebidders (S4110). The bid is conducted step-wisely with a differentelement until the bidders are narrowed down to the predetermined numberof successful bidders or the bid processing has been completed with allthe elements set in the bid information.

In S4130, the narrow-down processing is executed. Specifically, whenthere is no element for conducting a bid at the next stage, a bidder whohas offered the price that most satisfies the requirements of the useris determined as a successful bidder. On the other hand, if a price isfixed or if a price itself is not handled in a bid, successful biddersare narrowed down to a predetermined number in accordance with apreviously defined predetermined rule.

On the other hand, if it is determined in S4080 that the bid-off selfselection is set, the list screen XD illustrated in FIG. 64 is displayedfor enumerating bid information of a predetermined number of bidders ina list form. The user can view the list screen XD by selecting a screendisplay after entering a password on the screen of the terminal 30. Thelist screen XD enumerates candidates in a priority order in terms of thevalues of elements (displayed as the code number), so that the user candetermine a trading partner while referencing other information offeredby the bidders. Upon determining a trading partner, the user enters theassociated code number in the successful bidder selection entry fieldXD2 and then selects the decision button 192. The successful bidderinformation selected by the user is transmitted to the server 21 throughthe Internet N.

In S4150, it is determined whether or not a successful bidder has beendetermined. The list screen XD is continuously displayed (S4140) untilthe user determines a successful bidder, and the procedure flowcontinues to step S4160 when a successful bidder is determined. InS4160, the server 21 notifies both the user and the successful bidder ofthe establishment of the trade.

Next, a procedure of a numerical value auction will be explained withreference to a flow chart of FIG. 66. This procedure is used forconducting a bid, when “NUMERICAL VALUE” is selected as an element inthe element auction of FIG. 59, to compete the element (numericalvalue). It should be noted that a procedure shown from S5010 to S5070also comprises a bid procedure.

In S5010, evaluation data 21 is collected to an associated article orservice.

In S5020, an equation is acquired for a key word.

In S5030, evaluation points are acquired for evaluation itemscorresponding to variables used in the equation for the key word.

In S5040, the evaluation points are substituted for the variables in theequation for the key word to calculate an evaluation point for the keyword.

In S5050, evaluation percentages are acquired.

In S5060, the evaluation point of each key word is multiplied by eachevaluation percentage, and resulting products are accumulated tocalculate a total evaluation point.

In S5070, the result of the evaluation is displayed on the screen.

As appreciated from the foregoing, the following advantages are providedaccording to the seventh embodiment.

(17) Since a bid is conducted with an element other than the price, itis possible to conduct an auction which satisfies requirements otherthan the price.

(18) Since a plurality of elements can be selected, it is possible toconduct an auction which more satisfies requirements of a client.

(19) Since requirements of a client are evaluated in the form ofnumerical value such that an auction is conducted to compete theevaluated numerical value as an element, abstract requirements (degreeof satisfaction, future, potential growth, usability, key word, and soon) which cannot be replaced with physical amounts can be auctioned totrade the provision of an article or a service which most satisfies therequirement by auction.

(20) Upon receipt of a request for acquisition of information from aclient, the server widely promotes third party through the Internet N toprovide the requested information, conducts a bid for a certain elementwithin the contents of offered information in such a manner that theclient selects an information provider (bidder) who offered contents ofinformation that most satisfies the requirements of the client as asuccessful bidder. It is therefore possible to acquire most appropriateinformation as to how one can be provided with a desired article orservice even if a provider or a providing company of such article orservice does not participate in the auction. Particularly, a fishingboat may provide fishermen and fishing boats with information on signsof fish which is not a target of the fishing boat itself but may beintended, for example, by other fishing boats, other than fish which iscaptured by the fishing boat, thereby making it possible to effectivelyuse information which is valuable for other persons viewed from thethird parties.

Eighth Embodiment

In the following, an eighth embodiment which embodies the presentinvention will be explained with reference to FIGS. 67 through 74. Anauction system of this embodiment (hereinafter referred to as the“victim rescue system”) selects the most appropriate rescuer for arescue activity, and conducts a bid to compete a numerical value or anevaluation numerical value as an element. In other words, this systememploys the evaluation auction according to the seventh embodiment toevaluate whether or not a bidder is appropriate for requesting him for arescue in the form of numerical value, as a system for selecting arescuer who performs rescue activities at an accident spot, and conductsa bid with the evaluation value. This victim rescue system is possessedby rescue support service dealers (companies) which practice, asbusiness, rescue operations and rescue intermediary operations forensuring the safety of customers such as a security company, a guardcompany, and so on, and customers such as individuals, legal persons andso on which have concluded a utilization contract with such a dealer canonly use this system through terminals. The utilization of this systemat an individual or family level may include a rescue from a racketeersuch as an invader (stealer, intruder) to one's house, a rescue from anaccident and wreck when one is out, a saving when one is ill, a rescuein the event of fire, disaster such as inundation, and so on. On theother hand, the utilization of this system by a legal person may includea rescue of an employee when he is involved in an accident or an affair,a rescue of a car, a ship, an airplane or the like possessed by thelegal person from an accident or a wreck. This embodiment will bedescribed for an example in which a marine transportation dealer (legalperson) is a customer who uses the victim rescue system to select arescue ship for rescuing an SOS ship at auction.

A ship, if involved in an accident and asks for a rescue, would want tofind a ship which could come to its rescue soonest. However, when theship transmits SOS to all ships, the respective ships are moving intheir respective directions. If several ships individually change theirdirections to go to the rescue of the ship, confusion would prevail nearthe spot, leading to a secondary disaster as the case may be. Therefore,the victim rescue system of this embodiment selects at auction, as arescue ship, a ship which, for example, is moving toward and nearestfrom an SOS ship, has a sufficiently high level of rescue skill requiredfor a rescue activity for the SOS ship, and can start the rescueactivity most rapidly.

FIG. 67 generally illustrates the configuration of the victim rescuesystem. The victim rescue system 10 comprises an auction managementsystem 20 for managing the system 10, a network (for example, theInternet) N, and terminals 30 of users connected to the auctionmanagement system 20 through the network N. The auction managementsystem 20 comprises a server 21 for providing information and servicesin conformity to a request from a user, and three databases 201 to 203connected to the server 21. Alternatively, the server 21 may becomprised of a web server and an application server in separation.

The terminals 30 of users are classified into a terminal 31 equipped ina SOS ship 210 as a rescue requester, and a terminal 32 equipped in anparticipant ship 211 as a bidder which is notified of a rescue request,if any, from the SOS ship 210. When the SOS ship 210 requests for arescue to the victim rescue system 10 from the terminal 31 through thenetwork N, a rescue request screen FF illustrated in FIG. 71 isdisplayed on the terminal 31 to enter required items on the screen FF.Then, after entering the data, information on the SOS ship 210 isdelivered to the auction management system 20 through the network N.

Upon receipt of the rescue request, the auction management system 20notifies a plurality of ships 211, which have subscribed in the system,of the fact that the rescue request has been received through thenetwork N. Among participant ships 211 which have received the request,those which can go to the rescue of the SOS ship 210 each display anauction participant screen GG illustrated in FIG. 72 on the terminal 32,enter required items on the screen GG, and deliver information relatedto the ship 211 itself to the auction management system 20 through thenetwork N after entering the data, thereby participating in an auction.Then, the auction management system 20 selects the ship most suitablefor the rescue out of the participant ships 211 as a rescue ship atauction.

Alternatively, the victim rescue system 10 may be configured such thatan SOS ship 210 requests for a rescue through a radio transmission usinga transceiver 212 via a rescue center 213, as illustrated in FIG. 68.More specifically, the rescue center 213 comprises a terminal 214connected to the network N, and a transceiver 216 capable ofcommunicating with transceivers 212 equipped in the respective ships210, 215. Then, information related to the respective ships 210, 215 maybe previously registered in the rescue center 213, so that upon arequest for a rescue from an SOS ship 210, a rescue request is sent fromthe SOS ship 210 through radio communication to notify the rescue center213 of information on its current position.

Then, the information related to the SOS ship 210 is delivered from therescue center 213 to the auction management system 20 through thenetwork N. Subsequently, the auction management system 20 collects shipswhich can go to the rescue of the SOS ship 210, in a manner similar toFIG. 67, and selects as a rescue ship the ship most suitable for therescue from the participant ships 211 at auction. Alternatively, therescue center 213 may be equipped with a radar or the like, such thatthe radar locates the SOS ship 210, in which case the SOS ship 210 mayonly need to transmit an SOS signal through radio communication at thetime of accident.

As illustrated in FIGS. 67 and 68, the victim rescue system 10 alsocomprises a transceiver 26 which is capable of communicating with aspace satellite 218. The space satellite 218 comprises an explorationsystem capable of positioning the SOS ship 210, which may comprise acamera having a telephoto lens, a radar system, an infrared explorationsystem, a variety of radio wave exploration systems equipped in thesatellite, or the like. The auction management system 20 receives videodata on the accident spot captured by these systems through thetransceiver 217. The video data is transmitted to the respectiveterminals 32 of the participant ships 211 through the network N, so thateach of the participant ships 211 can monitor the situation of the SOSship 210 by displaying the accident spot (accident situation) of the SOSship 210 on the screen of the terminal 32.

In the following, there are listed examples of rescue ships which, evenif selected by the auction management system 20 as a rescue ship whichcan arrive at the accident spot soonest, cannot serve as an appropriaterescue ship. (1) When an SOS ship is a special ship such as atransportation ship for transporting chemical substances, radioactivesubstances, explosive hazardous substances, wasted substances, and soon, an LNG ship, a petrol tanker, and so on. (2) When an SOS ship is solarge that a small rescue ship can save only a limited number ofpersons, requires a long time for a rescue, or is exposed to a danger inthe rescue. (3) When an SOS ship is small, while a rescue ship is large,contrary to (2). (4) When a rescue ship is in a particular relationshipwith an SOS ship, such as a concernment, a congeneric relationship, andso on. (5) When an SOS ship was fired, sea-jacked, attacked by an armedship, or the like.

In the above listed cases, other elements should also be taken intoconsideration in addition to the time which is an element for selectingan appropriate rescue ship. More specifically, elements such as thesizes of both ships, the number of persons to be saved (quantity),degree of danger, rescue techniques, and so on are required in additionto the time, for selecting a rescue ship at auction. Therefore, in thisauction, the elements other than the time are evaluated to select therescue ship which appears to be the most appropriate from participantships and public ships, followed by notification of a request for arescue to the selected ship. When an SOS ship is sea-jacked, a guardship nearest from the SOS ship is notified. In the case of a fire, achemical fire boat, a chemical fire helicopter, a fire boat, or the likemay be selected as a rescue ship, depending on the fire.

On the other hand, when there is no ship to which a request for a rescuecan be made around the SOS ship 210, or when a ship, even if it canarrive at the accident spot of the SOS ship 210 soonest, is determinedto have physical difficulties in participating in rescue activities,other ships which do not participate in the victim rescue system 10 areaddressed for participation. For example, this may be applied to asituation in which the SOS ship 210 is expected to have sunk at the timeeven the ship, which can arrive the accident spot soonest, would arriveat the SOS ship 210. In this event, since this is concerned with ahumanistic problem, the system must be extended so that a ship apt to bea rescue ship, whether it participates in the rescue system or not, isincluded as a potential rescue ship. Therefore, in this event, a requestfor a rescue is broadcast to other systems which do not participate inthe victim rescue system, in which case the space satellite 218, forexample, may be used to find the potential rescue ship which ispositioned nearest from the SOS ship 210 and is navigating toward theSOS ship 210, and to request this ship for a rescue through radiocommunication.

Thus, there are two contract forms concluded by the SOS ship 210 for thesystem 20: (1) the SOS ship 210 or a person who requests for SOS(customer) directly uses the victim rescue system 10 (FIG. 67); and (2)the SOS ship 210 or a person who requests for SOS (customer) requestsfor a rescue ship, for example, to the rescue center 213 in which theSOS ship 210 or the person has registered as a customer, rather thandirectly utilizing the system 10, and uses the system 10 from the rescuecenter 213 or the like (FIG. 68). In the former case, there is acontract relationship between the SOS ship 210 or the person whorequests for SOS and the system 20, while in the latter case, there is acontract relationship between the rescue center 213 or the like and thesystem 20. An auction may be conducted using either of the cases. Thisembodiment will be described for the case in which the victim rescuesystem 10 configured as illustrated in FIG. 67 is employed.

An auction home page (HP) (site) resides in the server 21, such that auser utilizing the victim rescue system 10 displays the auction HPillustrated in FIG. 3 on a screen through the network N using a browserapplication from a terminal 30. The user can register or participate inan auction by entering required data on the time auction HP. Here,person who are permitted to participate in an auction are limited tothose who have registered as users in order to ensure the reliability ofthe information provided by them. The auction HP has a variety ofscreens linked thereto, including a user registration screen PAillustrated in FIG. 70; a rescue request screen FF illustrated in FIG.71; an auction participation screen GG illustrated in FIG. 72; and soon. The server 21 stores on its hard disk screen data for the variety ofscreens HP, PA, FF, GG and so on, a program for use in displaying thescreens and so on (for example, an HTML description program), a programfor use in computing processing involved in the auction, and so on.

As illustrated in FIG. 69, the time auction HP is provided with a largenumber of selection buttons 221, 222 which are classified according toarticles and services possibly traded in an auction. A person whodesires to participate in the victim rescue system 10 selects a “rescuerequest” button 222 from among the large number of selection buttons221, 222. The auction HP is also provided with a “user registration”button 223 for registration of a user for an auction; a “request” button224 for an SOS ship 210 to request for a rescue; a “bid” button 225 fora ship participating in an auction to participate in the auction; and soon.

Selection of the “user registration” button 223 causes the userregistration screen PA, illustrated in FIG. 71, to be displayed on theterminal 30. The user registration screen PA, where the user is a marinetransportation dealer, is provided with a variety of entry fields PA1for entering the name of a ship, the type of the ship, the owner of theship, a telephone number of the owner, an electronic mail address of theowner, remarks, and so on. As the user enters required items in all theentry fields on the user registration screen PA and selects a “decision”button 231, this user registration data D31 is transmitted to the server21 through the network N and stored in a customer management database201. Upon confirming that the user has paid a predetermined commission,the server 21 transmits an authentication number (ID number andpassword) to the terminal 30 of the registered user. The registered useruses the authentication number for utilizing the time auction.

When an SOS ship 210 requests for a rescue, the operator opens theauction HP, selects the “request” button 224 on the auction HP, anddisplays the rescue request screen FF illustrated in FIG. 71 on aterminal 31 on the SOS ship 210. The rescue request screen FF isprovided with a GPS button 232 for identifying the position of the SOSship 210, and a variety of entry fields FF1 to FF8 for entering how tocontact the SOS ship 210, the name of the ship, the number ofpassengers, the type of draft, a load, an affiliation to which the SOSship 210 belongs, a trouble situation, an ID number, and so on. The SOSship 210 contains GPS (Global Positioning System), so that uponselection of the GPS button 232 on the screen FF, the position measuredby the GPS is set as a current position of the SOS ship 210.

In an affiliation entry field FF6, information for determining apriority order upon selecting a rescue ship is entered in considerationof the interest, kindred, special relationship and so on with the SOSship 210, such that the entered information is used to preferentiallyrequest, for example, a ship having the kindred with the SOS ship 210for a rescue, avoid requesting a ship having the interest with the SOSship 210 for a rescue, and so on. In a trouble situation entry fieldFF7, in turn, a situation of an accident (details on the accident), forexample, is entered in characters. As the user enters required items inthe respective entry fields FF1 to FF8 and selects a transmission button233, the request information data D32 is transmitted to the server 21and stored in a request information management database 202.

The auction management system 20, upon receipt of a request from the SOSship 210 for a rescue, transmits information on the SOS ship 210together with a notice of rescue ship collection to ships which havesubscribed in the victim rescue system 10. Here, on the terminal 32which receives the notice of the rescue ship collection, the notice isdisplayed on the screen, or an alarm or the like is generated from aspeaker for notification. When a participant ship 211 offers a rescue ofthe SOS ship 210, the participant ship 211 opens the auction HP, andselects the “bid” button 255 on the auction HP to display an auctionparticipation screen GG illustrated in FIG. 72 on its terminal 32.

The auction participation screen GG is provided with a “display detailson SOS ship” button 234, a remaining time display field GG1, and an SOSship position display field GG2. Upon selecting the “display details onSOS ship” button 234, information on the SOS ship 210 is displayed, sothat detailed information on the SOS ship 210 can be viewed in theparticipant ship 211. The auction participation screen GG is alsoprovided with entry fields GG3 to GG12 respectively for entering theship name of the participant ship 211, the position of the participantship 211, the bearing, a path, a maximum speed, a maximum number ofpassengers, a maximum load amount, the type of ship, rescue techniques,and an ID number. In the bearing entry field GG5, the bearing (forexample, the orientation) of the participant ship 211 is entered. In thepath entry field GG6, a path until the position of the SOS ship 210 isentered. In the ship type entry field GG10, the type of the participantship 211 (the type of ship, for example, a tanker, a sightseeing ship, amarine communication ship, and so on) is entered. In the rescuetechnique entry field GG11, specific details on rescue techniques whichcan be provided for rescue activities are entered, for example,apparatus for use in the rescue provided by the participant ship 211,rescue techniques and technical level possessed by passengers on boardthe participant ship 211, and so on.

Upon selection of the participation button 235 after entering requireditems in the respective entry fields GG3-GG12, bid information data 33is transmitted to the server 21 and stored in the bid informationmanagement database 203. The server 21 uses data transmitted from therespective participant ships 211, and selects a participant ship 211which can most effectively rescue the SOS ship 210 as a rescue ship. Inthis event, for simplifying entry operations, items other than the SOSship position and trouble situation on the rescue request screen FF mayhave been previously entered in the database 202 of the system 20, suchthat minimally required items may be entered upon requesting for arescue ship. Likewise, on the auction participation screen GG, itemsother than the position, bearing, path of the participant ship 211 mayhave been previously entered in the database 203 such that minimallyrequired items may be entered upon participating in the auction.Alternatively, the system 20 may be configured such that only selectionof the “transmission” button 233 on the rescue request screen FF causesinput values to be automatically entered in the associated fields andtransmitted to the auction management system 20. Likewise, the system 20may be configured such that only selection of the “participation” button235 on the auction participation screen CC causes input values to beautomatically entered in the associated field and transmitted to thesystem 20.

Only rescue contractors which have concluded to be rescuer with rescuesupport service dealers can be bidders and a rescuer (successfulbidder). For this reason, the bid screen is transmitted only toterminals of the rescue contractors. The rescue contractors shouldemploy a terminal which has an arrival notifying function for notifyingincoming data by means of sound, vibrations, light, or the like. Ofcourse, it is possible to use a commercially available portable terminalsuch as a portable telephone and so on which has an arrival melodyfunction or an arrival vibration function. With a portable terminal (forexample, PDA or the like), a small personal computer and so on which donot originally comprise a software program for implementing the arrivalnotifying function, a program of the arrival notifying function may beentered in bid screen display data transmitted by the server, such thatthe arrival notifying function is performed when the bid screen displaydata is received.

While a rescue requester may have a commercially available portabletelephone, PDA or small personal computer, a portable terminal dedicatedto a rescue may be supplied to the rescue requester. This portableterminal may comprise, in addition to GPS and a camera, a plurality ofselection buttons, for example, classified according to the contents ofrescue. The rescue requester can transmit required information includingthe position, video, and details on a rescue to the server only throughmanipulation on a button. The video is transmitted, for example, for afixed period of time (for example, 10 seconds to 5 minutes) after amanipulation on the button. The camera, in turn, may be for capturing amoving image or for capturing a still image.

It is contemplated herein that even if the ship which can arrive at theaccident spot soonest is selected, the rescue operation will notprogress satisfactorily if the selected rescue ship is small in scale orlacks rescue techniques. To solve this problem and select a ship whichcan most efficiently and smoothly carry out the rescue operation, anauction in this embodiment is conducted to compete not only the time butalso other elements. In other words, the server 21 evaluates inputvalues (entered data) entered in the respective entry fields GG3 to GG11on the auction participation screen GG for each of items which arerequisites for a rescue, and conducts an auction based on numericalvalues resulting from the evaluation.

More specifically, as illustrated in FIG. 73A, using input valuesentered in the respective entry fields FF3 to FF8 on the rescue requestscreen FF of FIG. 71, the server 21 conducts numerical evaluation (forexample, on the basis of 100 points), as requisite items for a rescue,for example, an available time (minutes) which is a limited timeavailable for a rescue, the size of the ship (t), the number of personsto be saved (persons), and a required rescue technical level which isrequired to rescue the SOS ship 210.

Next, the server 21 selects a rescue ship from a F plurality ofparticipant ships 211 based on the numerical values associated with theSOS ship 210. Specifically, as shown in FIG. 73B, using input valuesentered in the respective entry fields GG4 to GG11 on the auctionparticipant screen GG of FIG. 72, the server 21 evaluates, for each ofthe participant ships 211, a time required to arrive at the accidentspot (minutes), the size of the ship (t), and the number of persons whocan be saved (persons), as requisite items for the rescue, as well asthe rescue technique degree possessed by the participant ship 211. Here,the server 21 selects a participant ship Y which offers all thenumerical values greater than those of the SOS ship 210, as a rescueship, from among participant ships X to Z shown in FIG. 73B. Then, theserver 21 selects the participant ship 211, as a rescue ship, which canarrive at the SOS ship 210 soonest and receive the number of persons tobe saved, and has the rescue techniques which can avoid the danger to anaccident situation of the SOS ship 210.

In this event, not limited to the selection of only one rescue ship, aplurality of rescue ships may be selected. For example, if the SOS ship210 is so large that only one rescue ship cannot accommodate, the server21 may select a plurality of participant ships 211 which have the rescuetechniques available for the rescue operation and can arrive at the SOSship 210 within a predetermined time as a plurality of rescue ships.

Alternatively, information provided by third parties (informationprovision contractors in principle) may be used to conduct an auction,without limiting to the auction system in which ships participating inthe auction can only be selected as a rescue ship. In other words, theserver 21 may widely promote third parties to provide information onships which can be suitable for rescue ships, and conduct an auctionbased on the information to select the most suitable rescue ship. A shipselected by the information is notified through a radio communication,the Internet or the like to force the ship to go to the accident spot.

The rescue of the SOS ship described above is a mere example, and theauction method according to this embodiment may be used for a rescue fora wreck in mountain, attack by a bear, a person or the like, fire in abuilding or the like, bandit, confinement or the like, natural disasteror disaster caused by man, accident, and so on. In this event, thepolice, fire stations, hospitals and related facilities, accidentconcerns and private patrol cars, guard cars, private rescueorganization members and so on may participate in the system 10 througha device or a communication terminal which notifies crime watch, fire,accident, emergency or the like. The system 10 evaluates the situationand selects one which offers numerical values that indicate that it canrescue soonest.

Elements of the system for narrowing down such a large number ofrescuers, rescue facilities, rescue ships, rescue cars and so on to themost optimal rescuer or rescue method for selection include time,distance, movement, size, quantity, technical level, relation degree,specialty, public degree, dangerous degree, price and so on, all ofwhich are combined with one other. Thus, the auction of this embodimentevaluates respective elements for automatic determination andnarrow-down in order to select the most optimal one from all possiblecombinations as a rescuer (a rescue method).

By using the auction of this embodiment, it is possible to select thesecurity company, guard company, guardsman or the like that is mostsuitable for a rescue from many eligible rescuers. In a conventionalsecurity system (guard system) in which a rescue requester directlymakes a contract with a security company, a guard company or the like,the rescue requester will request the previously contracted securitycompany (guard company) for a rescue when the rescue requester suffersfrom a disaster, accident, crime or the like.

In contrast, when the victim rescue system 10 is used, a plurality ofrescue dealing companies (security companies, guard companies and so on)and individuals such as guardsmen and so on participate in the auction,which is conducted among the participant companies and individuals toselect a company or an individual (guardsman or the like) optimal to aparticular rescue field. Also, when a person is out from his house orcompany and encounters an accident, an affair, an illness or a wreck andtherefore requires a rescue, he, i.e., a resulting rescue requester(customer) may use the victim rescue system 10 using an individuallycarried terminal (for example, the portable terminal 74 having the GPS79 illustrated in FIG. 17) to select the rescue organization or anindividual who happens to be near the rescue position or can arrive soonat the spot utilizing appropriate facilities, and has the mostappropriate techniques and skills in accordance with details on aparticular rescue request (accident, crime, disaster or the like). Thus,even if a person is attacked by a racketeer or an animal (bear or thelike) when he is out, the most convenient policeman, guardsman or hunteris selected so that the appropriate rescuer is sent to the rescuerequester. Of course, ordinary alpinists, volunteers and so on mayregister as rescuers from the friendly spirit for a simple rescue. If arescue can be easily performed by anyone, a person who happens to passnearby is selected as a rescuer, so that a rescue requester can bepromptly rescued without inducing exaggerative activities. For example,assuming that a senior person, walking alone along a mountain path whileon a journey, falls down and wants a help for recovery, if the seniorperson requests for a rescue with a portable terminal, a traveller whohappens to be walking along the same mountain path is selected as arescuer so that the senior person can be rescued (helped) immediately.Also, even if a person receives a serious wound on a mountain path, atraveller who happens to pass nearby is selected as a rescuer so thatthe traveller can give first aid to the person before a true rescuer(ambulance man or the like) arrives. The request screen is provided withan entry field for entering a technical level required for a rescue, andgeneral persons such as alpinists, volunteers and so on may be regardedas candidate rescuers when a rescue requires a low technical level.Further, if a rescue requester offers a required level (rescuecapabilities, results, contribution and so on), the auction of thisembodiment may be used to select an optimal organization or individualin accordance with the required level of the requester.

Next, a flow of the auction from a request for a rescue to selection ofa rescuer(s) will be explained with reference to FIG. 74. It should befirst noted that the illustrated procedure flow does not necessarilyshow a processing procedure of the server 21 but shows a procedure(flow) of the entire auction. The following explanation is given for anexample in which a rescue requester is a ship belonging to a marinetransportation dealer (SOS ship).

In S6010, information on the rescue requester is entered. Specifically,when the SOS ship 210 requests for a rescue, required items are enteredin the respective entry fields FF1 to FF8 on the rescue request screen.It should be noted that a procedure in S6010 wherein the rescue requestscreen is displayed on a terminal of the requester, and the server 21receives request information data 32 of the SOS ship 210 entered on thatscreen corresponds to a request procedure.

In S6020, the presence or absence of a request for a rescue from arescue requester is determined. The procedure flow waits in S6020 untila request for a rescue is made.

In S6030, an auction is started. Here, a request for rescuing a ship isnotified to respective terminals 32 possessed only by ships which havesubscribed in the victim rescue system 10 through the network N tocollect participants in the auction.

In S6040, information offered by a bidder is entered. Specifically, whena participant ship 211 participates in the auction with intention forrescuing the SOS ship 210, the participant ship 211 enters requireditems in the respective entry fields GG3 to GG12 on the auctionparticipation screen GG. It should be noted that the procedure in S6030,wherein the bid screen is displayed on terminals 31 of bidders, and theserver 21 receives the bid information data 33 on the participant ship211 entered on that screen, corresponds to a bid procedure.

In S6050, it is determined whether or not there are applications to theauction. In other words, it is determined whether or not there are bidsfrom bidders. When there are bids, the procedure flow continues toS6060. On the other hand, when no bid is applied, the procedure flowcontinues to S6080. A procedure from S6050 to S6110 corresponds to a bidacceptance procedure.

In S6060, the evaluation processing is executed. Specifically, each ofrequisites for rescuing the SOS ship 210 (for example, arrival time,size of ship, rescue technical level and so on) is evaluated using inputvalues entered in the entry fields GG4 to GG11 on the auctionparticipation screen GG of FIG. 72.

In S6070, bid processing is executed with numerical values.Specifically, participant ships 211 which have participated in theauction are listed in a priority order using the numerical valuesresulting from the evaluation in S6060, wherein ships more suitable as arescue ship are given higher priority levels, to select a rescue ship.

In S6080, it is determined whether or not a limited time has expired.When within the limited time, the procedure flow returns to S6050 toagain determine the presence or absence of new participants in theauction. At the expiration of the limited time, the procedure flowcontinues to S6090.

In S6090, it is determined whether or not a rescuer has been determined.Specifically, for selecting a rescue ship, the procedure flow continuesto S6110 if only one ship has been selected as a rescue ship in S6070.Otherwise, the procedure flow continues to S6100 when a plurality ofships have been selected as rescue ships because calculated numericalvalues are the same.

In S6100, narrow-down processing is executed. Here, for selecting onlyone from participant ships 211 which offered the same condition when thebid processing was executed in S6070, the participant ships 211 arenarrowed down based on conditions other than the numerical valuesresulting from the evaluation, for example, the expenditure required forrequesting for a rescue ship, such that the SOS ship 210 is leastpossibly burdened in terms of funds.

In S6110, the server 21 notifies both parties of the establishment ofthe trade. While FIGS. 67 through 74 have illustrated the systemconfigurations and screen layouts intended for a rescue for a ship, theentry fields on the screen may be changed as appropriate inconsideration of who is a rescue requester and which type of rescue isrequired. For example, with intention for a rescue at an individual orfamily level or for a rescue for individual employees of a legal person,each requester carries a GPS equipped terminal (a portable telephone,PDA or the like), so that the variety of screens are displayed on theterminal carried by each requester or rescue contractor (bidder).Information entered on the request screen for use as materials fordetermining a rescuer includes details on a rescue for a requester, forexample, an accident, an affair (type of crime), whether or not therequester is wound, graveness of wound, situation of victim, situationof wreck, name of disease, episode, techniques required for a rescue,number of persons to be saved, and so on. Also, the bid screen displaysa map (map information) in place of a chart, on which the rescueposition is identified.

In addition to the GPS, the terminal of the rescue requester may beequipped with an imaging device such as a camera. For example, theportable terminal 74 equipped with the GPS 79 illustrated in FIG. 17 isused and is equipped with a camera 87 as an imaging means as illustratedin the figure. In this event, an image captured by the camera 87 isdisplayed on terminals of bidders, so that the bidders can confirm thesituation of the victim of the rescue requester (or a person whorequests for a saving other than the requester) on the screen beforeparticipating in the bid. For example, if a person is involved in anaccident or an affair while he is out, the position can be notifiedthrough the GPS 79, and a request for a rescue can be made with an imageof the accident or an image of the affair captured by the camera 87 ofthe portable terminal 74, thereby making it possible to determinetechniques and skills required for candidate rescuers from the videoimages to select a more appropriate rescuer. It is also possible tocorrectly know required information such as a situation of wound of therescue requester and so on and moreover consider appropriate rescuemethods through the video images. Thus, the rescue requester is rapidlysaved by a more optimal rescuer in accordance with the details on therequest for a rescue. It is also possible to view the images from theimaging device in the management system 20 to determine the victim levelof the disaster or the like from the video image in the managementsystem 20 and evaluate a rescue technical level by a judge of the system20.

As appreciated from the foregoing, the following advantages are providedaccording to the eighth embodiment.

(21) A rescue requester can select the most appropriate rescuer fromamong rescuers participating in an auction by making use of the system20 through a terminal. For example, when a ship belonging to a marinetransportation dealer encounters a wreck, this SOS ship (SOS originator)210 can select the most appropriate rescue ship (rescuer) fromparticipant ships 211 which participate in the auction. It is thereforepossible to accomplish effects such as execution of rapid rescueactivities, avoidance of confused rescue activities, and so on as wellas to limit an extra expenditure such as a cost which would occur wheneven ships useless for the rescue were asked for the rescue.

(22) Conventionally, when an individual, a family or a legal person issecured, it is general tendency to make a contract with a securitycompany, a guard company or the like, so that they will request thepreviously contracted company for a rescue upon requesting for a rescue.However, by the use of the victim rescue method of this embodiment, anauction is conducted among a plurality of bidders to select the mostsuitable bidder as a rescuer, thereby making it possible to extend therange of the request for a rescue, and select a rescuer more suitablefor a particular rescue as compared with the prior art.

(23) Conventional security companies and guard companies are intendedfor the guard of a residence or a company, so that an accident, anaffair (crime), an illness, or a disaster encountered while a person isout for journey, shopping and so on cannot be contemplated for a rescue.For this reason, a rescue, while a person is out, can only be requestedby telephone to a public organization such as the police, the firestation or the like which is dedicated to a rescue. However, with theuse of the system 20, even when a requester is out, he may request thesystem 20 for a rescue through a terminal carried by himself (theportable telephone 74, PDA or the like), resulting in selection of anoptimal organization or individual as a rescuer, in accordance with therescue position and details on the request for a rescue. Therefore, therequester is rapidly saved in an appropriate rescue method at the rescueposition while he is out.

(24) The utilization of the system 20 results in an extended range ofrequests for rescues, so that when ordinary persons such as alpinists,volunteers and so on register as rescuers from the friendly spiritintended for a simple rescue, for example, such as a help, a person whohappens to pass nearby can be selected as a rescuer, so that a rescuerequester can be promptly rescued without inducing exaggerativeactivities.

The eighth embodiment may be modified in the following manners.

The bid procedure is not limited to the method of entering requireditems on the request screen displayed on the screen of a terminal of arequester. For example, if a rescue requester (victim) holds a GPSequipped portable terminal and connects to a rescue support serviceserver through the portable terminal, the server acquire automaticallyposition data of the rescue requester from a terminal throughcommunications, and inquires a current victim situation of the victimwith an artificial voice so that the server receives voice data of thevictim who orally answers questions as bid request data as it is. Withthe employment of such a request procedure, even if a victim hasdifficulties in using hands or viewing, for example, due to wound orillness, it is possible to correctly accept the situation of the victim,and realize an appropriate rescue.

A rescue requester and a victim are not limited to be identical. This isbecause, for example, a person who has found a victim may use the rescuesupport service, determining that the person cannot accommodate thevictim. In this event, the rescue requester enters spot position data ifhe requests for a rescue from a position away from the spot. Inaddition, since a rescue spot may move, as is the case of requesting fora rescuer for saving a person who was taken over by a robber togetherwith his car, information on a predicted rescue spot position, a movingroute, and so on is also provided to bidders, such that the rescuernearest from the destination, rather than the position upon requesting,is selected.

Video data is not limited to be transmitted to bidders for viewing videoimages on the bid screen. For example, a disaster situation may bedetermined by viewing a video image on the server side to make sure ofappropriate rescuers and rescue capabilities such as rescue techniquesand so on on the service provider side and reflect the result ofdetermination on the contents of the displayed bid screen.

For collecting bids of rescuers, it is possible to limit a bidcollection area (region) since an area (region) in which rescuers canwork is limited from position data in the rescue request informationreceived from a terminal of a requester. For example, for a normalrescue which does not need the use of special facilities, apparatus andso on for the rescue, it is desirable to limit a collection area tosurrounding regions (for example, cities, towns, villages) around therequester. For determining the area, the server comprises areadetermination condition data. In the area determination condition data,areas are set in steps in accordance with details on disasters, by wayof example, and an area is set based on the urgency, and a ratio of thenumber of persons who can be rescuers. For example, for an accident, anaffair, a sudden attack of illness, and so on, which should be quiteurgently treated, a narrow area (for example, a city, a town, a village)is set. Also, when a large number of persons can serve as rescuers (forexample, for a simple rescue (assist) (for example, a help or the like)for which anyone can be a rescuer), a narrow area (for example, a city,a town, a village, or a narrower area) is set.

The server 21 may sequentially sense the position of a rescuer after therescue request procedure to notify a requester of a situation in whichthe rescuer is going to the rescue. Also, the server 21 may transmitvideo data received from a terminal of a requester, after the rescuerequest procedure, to a terminal of a rescuer to notify the rescuer of adisaster situation of a requester.

A specific configuration for communicating with the terminal 30 equippedin the SOS ship 210 or a participant ship 211 participating in anauction through a network using a personal computer may be implemented,for example, by connecting a portable telephone or PHS capable ofcommunicating through the Internet to the personal computer, or byconnecting a terminal dedicated to a connection to the network to thepersonal computer.

A terminal for use in requesting for a rescue or placing a bid is notlimited to a personal computer and a portable telephone and PDA capableof communicating through a network, but a terminal dedicated to thevictim rescue system, for example, may be used.

For utilizing an auction to select a rescue ship, it is not limited toselect the most suitable ship as a rescue ship in consideration of thesize of the ship, a rescue technical level and so on other than anarrival time to an accident spot, but the ship which can arrive at theaccident spot soonest, for example, may be simply selected as a rescueship.

Items assigned to the entry fields on the rescue request screen FF andthe auction participation screen GG may be freely changed asappropriate. In essence, the respective screens FF, GG may be providedwith entry fields for entering information with which the most suitableship can be identified during a selection of a rescue ship. If an itemother than a ship is to be rescued, the entry fields on the rescuerequest screen and the auction participation screen may be changed asappropriate in accordance with details on a particular disaster,accident, affair or the like.

Next, terms used in the eighth embodiment are defined as follows.

(1) A rescuer is not limited to a person, but includes a wide variety ofpersons, organizations, facilities and so on. Therefore, a rescuerincludes a ship, a train, a helicopter, an airplane and so on in which arescuer exists, and also includes an organization such as a rescue team,a rescue ranger, and so on. Also, the facilities include, for example, arescue robot, a remotely controlled rescue device, and so on,irrespective of manned or unmanned.

(2) A disaster or the like only needs to be an item which requires arescue (including a simple rescue such as a help), and includes a victimand a disaster caused by an accident, sudden attack of illness, wound,wreck, fire, inundation, earthquake, explosion, terrorism, injury case,stoker, confinement, bandit, and so on. Also, a victim includes a victimwho has suffered from the foregoing disaster (fire, earthquake,inundation and so on), and also includes an animal and so on, notlimited to a person.

The respective embodiments described above are not limited to theforegoing, and may be modified in the following manner.

After the establishment of a trade, it is necessary to proceed withdelivery of an article or provision of a service on the seller side, andsettlement of payment on the buyer side, in which case the settlementmay be made utilizing a net banking. FIG. 75 illustrates an example of atrading system of this type. The illustrated trading system comprises anauction management system 20, a banking system 300, and a distributionsystem 310, each of which possesses a server 21, 301, 311 interconnectedthrough a network (the Internet, a dedicated channel, or the like) N formutual communications. The banking system 300 places a net banking homepage for settlement, such that a buyer can pay in from the net bankingHP on a terminal 30 such as a personal computer installed in his house,a portable telephone, or the like. Of course, the net banking system 300may be connected to a large number of stores (for example, conveniencestores, banks, and their branch offices) 302 located in every regionsall over the country for communications, such that a buyer can pay in ata nearby store. The distribution system 310 in turn places acollection/delivery home page, such that a buyer can request fordelivery, such as delivery of an article, from the collection/deliveryHP on the terminal 30 such as a personal computer installed in hishouse, a portable telephone, or the like. Of course, the distributionsystem 310 may be connected to a large number of stores (for example,convenience stores and delivery branch stores) 312 located in everyregions all over the country for communications, such that a buyer canrequest for delivery to his house at a nearby store.

The auction management system 20 assigns a password to both parties uponthe establishment of a trade, so that both parties which haveestablished the trade can communicate with each other within a limitedperiod by entering the password on the home page. Also, both parties areassigned a trade code number upon the establishment of the trade, sothat the buyer specifies the trade code number to pay in to the netbanking system 300, while the seller specifies the trade code number torequest the distribution system 310 for delivery. After confirmation ofthe paying-in by the buyer to the net banking system 300 andconfirmation of delivery of an article by the seller to the distributionsystem 310, the auction management system 20 proceeds to a fund transferand delivery operation. According to this trading system, since the fundtransfer and delivery operation are performed after the confirmation ofthe paying-in to the system and the delivery of the article, while thetrading partners do not know their identities, a safe trade can becarried out.

While there are three different types of auction forms as illustrated inFIG. 76, an auction may be conducted in any form. Specifically, FIG. 76Ashows a sales supporting form, wherein an intermediary dealer offersfree value added services to potential buyers to widely collect buyers,and obtains contributions from a seller by offering sales supportingservices to the seller, such as introducing buyers to the seller, and soon. FIG. 76B shows a purchase supporting form, wherein an intermediarydealer offers free value added services to sellers to collect potentialsellers, and obtains contributions from a buyer by offering purchasesupporting services to the buyer, such as introducing sellers to thebuyer, and so on. FIG. 76C shows a sales/purchase supporting type,wherein an intermediary dealer offers sales supporting services topotential sellers as well as offers purchase supporting services topotential buyers to obtain contributions from both sellers and buyers.Of course, the intermediary dealer may obtain advertisement fees or thelike from third parties, without receiving contributions from buyers orsellers.

In the respective embodiments described above, an auction method asfollows may be employed when a plurality of elements are set. In a bidacceptance procedure, an index is previously set to determine theranking among the respective elements. Bids are simultaneously conductedin parallel for each of the plurality of elements, and a bidder who hasoffered the bid information with the highest index among the respectiveelements is determined as a successful bidder. For example, whenposition and time are specified, assuming that 1 km is specified as 50points in distance and 10 minutes are specified as 50 points in time, abidder who acquires 60 points, which are closest to 50 points inposition, is determined as a successful bidder, rather than a bidder whoacquires 40 points which are closest to 50 points in time.

In the respective embodiments described above, a plurality of terminalsin a description “providing to a plurality of terminals” may beunspecific or specific.

In the respective embodiments described above, “bid” means participatingin a bid, wherein a bid may be conducted with an element other than theprice.

In the respective embodiments described above, instead of staring a bidto wait for bids after a request is made from a client, bid informationpreviously acquired from bidders may be preserved in a database suchthat the person who has offered the bid information most suitable torequirements of the client is retrieved from the database upon receivinga request. In other words, while the respective embodiments haveemployed the method of staring a bid to wait for bids after a request ismade from a client and a method of preserving bid information previouslyacquired from bidders in a database such that a bidder who has offeredthe bid information most suitable for requirements of the bidder isretrieved from the database when a request is made, only the former maybe employed. In the former method, if a client can view, for example, abidding situation on the screen, the client may respond a plurality oftimes by offering conditions satisfying requirements of a bidder afterconfirming tendencies of other bidders.

In the position auction in the second embodiment, for example, when ataxi company bids off a customer, the taxi company may preferentiallybid off a customer who is going to the remotest destination if there area plurality of customers within a certain range. More specifically, thedistance between the position at which each customer takes a taxi and adestination is measured on map data to bid off the customer who offers alonger distance. In this event, if a plurality of taxi companiescompete, a taxi company which has a taxi nearest from the taxi takingposition or a taxi company which offers more favorable services to thecustomer will bid off the customer who offers a longer distance.

In the respective embodiment described above, an element other than theprice may be limited not to mean to include a bid conducted with theelement in the form of a mere conversion of a price, and substantiallyin the form of a mere price bid. For example, in the position auction,the element other than the price does not include those which are mereconversion from the price, and with which a bid is conducted with theprice. For example, the element other than the price does not includethose used in a bid in the form of a mere alternative of the price, suchas a bid conducted with an element having a proportional relationshipwith the price. However, an auction method which has a meaning of usingan element other than the price is included, such as that which cannotbe said to be a mere alternative of the price, and produces inherenteffects other than the price eventually by conducting a bid with theelement other than the price. For example, a higher rate is burdened inaccordance with a distance over which a taxi goes to receive a customer,it is out of the question to conclude that such a method is not includedin the invention, ignoring the effect of reducing a waiting time of thecustomer on the basis of such a reason that bidding of the nearest taxileads to a lower rate, and so on. With the employment of such a method,it is possible to more satisfy requirements other than the price.

In the respective embodiments described above, a trade by an auction maybe either onerous or gratuitous. For example, a trade may not involvesale or purchase but may be made free of charge. For example, wastes andused articles may be given, free of charge, to a person who can come andtake when the owner wants to dispose them but is in trouble how to treatthem. In such a situation, an auction may be used to look for a partnerwho takes over such articles. In this event, while a relationshipbetween a seller and a buyer is not virtually established because it isnot a dealing, the present invention is intended to contemplate evensuch a case of trading form. For example, the owner may determines theperson who is located nearest from him, or a person or a dealer whotakes over the largest weight or the largest amount of articles as asuccessful bidder. Alternatively, the owner may determine a person or adealer who takes over such articles at the lowest cost as a dealing.Otherwise, an article or a service offered by a manufacturer or the likefree of charge may be treated at auction.

In the respective embodiments described above, bidding conditions may beset as appropriate, and may be such as to determine a value at a certainrank from a predetermined direction or a person who offers the valueclosest to an average value of bidden prices, by way of example, inaccordance with a previously determined priority rule, from among anumber of bidders (a number of participants) as a successful bidder.

In the respective embodiments described above, price information is notessential to information related to an article. For example, theinformation related to an article may be, for example, information onlyon the article or on the article and its quality, i.e., informationother than the price. For example, as to art objects, antique objectsand so on, a seller himself may not know the value of his article andwant to identify the price through a bid. On the other hand, a buyerhimself may want to obtain a certain article irrespective of its price.In this event, the price itself merely has a secondary value. If theprice is included in bid conditions in this way as a matter of trading,a proper evaluation or trade may not always be expected due tovariations resulting from the course of events depending on the funds ofcompetitors. In such a case, the price would rather not be offered asbid conditions.

In the respective embodiments described above, when information relatedto an article includes information on a sales price or information on apurchase price, the information on a sales price or the information on apurchase price may be not only the sales price (or the purchase price)but also conditions on the sales price (or the purchase price), forexample, the lowest price (or the highest price), a range of price (aprice width), and moreover, a plurality of ranges of sales prices andpurchase prices which are set in steps for each of conditions, and soon.

In the first embodiment, the trade due date condition is not limited topriority rules such as the due date slide scheme, but may be, forexample, a specified trade due date (for example, a desired tradingdate) itself.

In the aforementioned first embodiment, the present invention is notlimited to a method of offering both a trading due date and a price froma client as is the case of the price slide setting type. For example, aclient may offer a plurality of trading due dates such that biddersselect one of the plurality of trading due date and set a price togetherwith the selected trading due date for participating in a bid.Alternatively, for example, a client may offer a plurality of pricessuch that bidders select one from the plurality of prices and set atrading due date together with the selected price for participating in abid. In this event, the client offers an allowable period in whichbidders can set a trading due date (for example, for a manufacturer,after a release day, after a period in which the manufacturer wants toleave articles at his hand, and so on), and this allowable period isused as the trading due date condition. For example, when amanufacturing company requests for a bid, for example, for purposes ofsales prediction, the allowable period may be, for example, after therelease day.

In the respective embodiments described above, when a method of using alist screen is employed, the trading due date condition may be an optiononly for selecting whether or not a bidder is requested to offer atrading due date (a trading date or the like) on a screen previouslyprovided for entering details on a request of a client on a home page onthe server side, in which case the client determines a successful bidderwhile viewing trading due dates offered by bidders on the screen of theterminal 30A. Further, the client need not always set the trading duedate condition. Alternatively, a screen provided to bidders when theserver collects bidders may be set to previously ask bidders to offerinformation on the trading due date, so that the offer of the tradingdue date is requested by the setting on the server side, instead of theclient. Also, in this case, the client can determine a successful bidderby comparing trading due dates offered by bidders.

In the respective embodiments described above, an investigation madebased on bid information of bidders is not limited to a salesprediction. The contents of investigation made on an article based onbid participation information offered by bidders may be an investigationon the rareness of the article, an investigation on a market price(value) of the article, an investigation on the distribution of thearticle, and so on.

In the aforementioned third embodiment, an auction may be conducted onlywith taxis which can be assigned immediately after a request is madefrom a customer, without consideration of information on conditions of acar and a driver, and road information such as a road situation.

In the aforementioned fifth embodiment, numerical values handled in anauction as an object of bid may be any units of physical amounts used asthe unit of traded articles, for example, the number of sheets,thickness, hardness, and so on, in place of length, height, area,volume, bulk, weight, quantity, and so on.

In the respective embodiments described above, a trade by an auction maybe either onerous or gratuitous. For example, the trade may not involvesale or purchase but may be made free of charge. For example, wastes andused articles may be given, free of charge, to a person who can come andtake when the owner wants to dispose them but is in trouble how to treatthem. In such a situation, an auction may be used to look for a partnerwho takes over such articles. In this event, while a relationshipbetween a seller and a buyer is not virtually established because it isnot a dealing, the present invention is intended to contemplate evensuch a case of trading form. For example, a free article or serviceevaluated as most suitable for requirements of a client, or a recipientwho receives provision of the article or service bids off. Otherwise, anarticle or a service offered by a manufacturer or the like free ofcharge may be treated at auction.

In the respective embodiments described above, an article/service may beanything as long as it can be traded, irrespective of whether it istangible or intangible. Exemplary categories may include, for example,(1) article/service field, (2) information/contents field, (3)idea/intellectual property field, and so on. In (1) the article/servicefield, the field may be divided into sub-categories such as ticket,passport, hotel, loan, finance, security, insurance, residence, realestate, car, bicycle, book, music, daily necessities, food, cosmetics,computer, game, auction, second hand article, telephone, businesssupply, bio, medicine, energy, resource, generator or evaluator ofintangible article (heat, light, wave, color, hue, brightness,electromagnetic field, and so on), and so on. In (2) theinformation/contents field, the field may be divided into sub-categoriessuch as recruiting, jump, outsourcing of works, inventory disposal,recycling, information contents, meeting, relation information,education, seminar, advertisement, introduction of trader, humannetwork, claim transaction, risk management, and so on. In (3) theidea/intellectual property field, the field may be divided intosub-categories such as idea, business planning, literary work,intellectual property, and so on.

A server, a network and a terminal may be implemented by a digitaltelevision capable of bidirectionally communications. In this event, theserver may be a computer in a television broadcasting station or thelike which emits digital data, while the terminal may be a televisioncapable of receiving digital broadcast programs.

The request procedure is not necessarily essential. For example, arequest may be made by telephone or interview, and the server mayexecute the procedures subsequent to the collection procedure(collection procedure, bid procedure, bid acceptance procedure) atauction through a network.

Display on the screen of the terminal is not necessarily essential. Therequest screen and bid screen used in the request procedure, collectionprocedure and bid acceptance procedure may be eliminated. For example,request information may be received by the server through audio datafrom a terminal of a client, and bid information may be received by theserver through audio data from terminals of bidders. Then, the servergenerates an artificial voice to the terminal of the client for guidingthat the request information is audibly produced, and generates anartificial voice to the terminals of the bidders for guiding that bidinformation is audibly produced.

Terms used in respective claims in this specification are defined asfollows:

An article is an item to be traded, irrespective of whether it isonerous or gratuitous.

A service is irrespective of whether it is onerous or gratuitous. Theservice includes a service offered free of charge by volunteer. Theservice also includes a service which does not use objects. The servicefurther includes a rescue for saving a victim by a rescuer (onerous orgratuitous).

The variety of screens such as the request screen, bid screen and so onare not limited to single screens but may be comprised of a plurality ofscreens.

The request screen and the bid screen are not essentially provided bythe same server (in a narrow sense) provided that they belong to a flowof sequential procedures by mutual linking or the like. In other words,each claim includes an implementation in which a server (in a narrowsense) for receiving data from a client in the request procedure isdifferent from a server (in a narrow sense) for transmitting andreceiving data in the collection procedure and the bid procedure. Agroup of such servers in a narrow sense also fall under a server (in abroad sense), so said in each claim.

The collection procedure refers to a transmission procedure for making astate in which collection information for collecting bids can be viewedon terminals. The collection procedure includes the case where theserver unilaterally transmits the collection information to terminals,and the case where the server transmits the collection information toterminals while responding to requests such as accesses from theterminals. An example of the former is a bidirectional television usedas a terminal, while an example of the latter is a personal computer,used as a terminal, capable of connection to the Internet forcommutation.

In a bid of unit price, an element which is equivalent to the bid ofunit price is a mere conversion of the price, so that such an element isexcluded. When an article sold in quantitative units (for example, OOyen per 100 grams, OO yen/m, OO yen/unit, and so on) is competed withthe unit (g, m, unit or the like) in the denominator within the unitindicative of the unit price (hereinafter simply referred to as theunit), the element is a mere conversion of the price if it is a fixedprice. Since this is substantially equal to a bid with unit price, evenif the bid is conducted with the element (g, m, unit or the like), suchan element is excluded. Also, in an example of service, when massageoffered at 3,000 yen per 30 minutes is bidden with “time” at a fixedprice, the element “time” of the service “massage” is excluded as anelement since the time bidding is substantially equal to the pricebidding. However, for an element with which a bid is established whereina unit price, not a fixed price, is not changed, an element “number” ina bid in which a person who buys the greatest number of apples at 100yen even by one more is determined as a successful bidder, cannot besaid to be a replacement of the unit price, so that this falls under anelement.

The unit (g, m, number and so on) of a “unit price” convertible to aprice (for example, OO yen/100 g, OO yen/m, OO yen/unit, and so on) isexcluded from elements. In this case, a fixed price which substantiallycorresponds to a bid of a unit price is not of course included inelements, and a bid in which the unit price is not changed such as thatin which a person who buys the largest number of apples at 100 yen evenby one more is determined as a successful bidder, is excluded fromelements since this is the unit of the unit price.

The attribute refers to information with which an article or a servicecan be identified, and the nature and contents which characterize thearticle or the service. The attribute of a service includes an attributeof a person who provides the service, an attribute of an object used forthe provision of the service, an attribute of an object used inutilization of a person who receives the offered service. The attributecan help differentiate from other articles and services. The attributeincludes, for example, design, contents of service, specification, modelnumber, performance, effect, quality, material, strength, reliability,taste, smell, fragrance, color, brightness, illuminance, sound volume,sound quality, temperature, pressure, size, component, log, career,title, capability, speed, length, weight, volume, bulk, area, nature,point, shape, pattern, coloring, type, system, product name, articlename, and so on. However, these are mere examples. While some of theseattributes can be converted to a price depending on articles andservices, the unit of a unit price of an applied article does not fallunder the attribute. For example, the unit of the unit price of anarticle sold in quantitative units does not fall under the attribute.However, when a wire of a standard length is cut into 2-meter pieces forsales, this “2 m” is nothing but a choice of a buyer and does not at allcharacterize the wire itself, so that it does not fall under theattribute of the wire. However, with a wire of a length out of standard,for example, 1000 km, this “1000 km” sufficiently characterizes thewire, so that it falls under the attribute. Whether a numerical value isan attribute or not is determined from determination as to whether ornot an associated article is characterized by the numerical value, i.e.,a numerical value represented by an element (unit or the like) is not astandardized value, the article can be made, owned, or skilled only by aparticular enterprise or craftsman, and so on. It should be noted thatattribute information on an article or a service offered by a client inthe request procedure is not an element, so that the price may be ofcourse included.

Even if the length falls under the attribute with a wire of 1000 km,this element is excluded with respect to the article “wire” since theunit “km” is the unit of the unit price at which the wire is sold. Forexample, liter, which is the unit of the unit price for a gasoline thatis traded at OO yen/liter, does not fall under the attribute, whereasthe liter for specifying the volume of an refrigerator falls under theattribute because the liter in this case characterizes the refrigerator.In this way, even if a unit does not fall under the attribute for somearticle, it does not mean that the unit does not fall under theattribute for all articles.

An “element which does not directly affect the price” refers to anelement in which a product of a unit price and the value of the elementdoes not indicate the price, rather than an element in which a price perunit of the element (unit price) is not an element normally handled in ageneral commercial trading field. Whether it directly affects the priceor not depends on a particular article. For example, the quantity(number), volume and weight, the difference in value of which directlyaffects the price, is excluded. A bid of an article at 100 yen withquantity, a bid of an article (for example, gasoline) at 100 yen perliter with volume, and a bid of an article at 100 yen per 1 kg withweight (the product of the unit price and the value of the element(quantity, liter, kg) is the price as it is) are excluded. Therefore, abid with an element which does not directly affect the price, forexample, a bid of an electric product with weight or volume, a bid of atelevision with scanning lines (quantity) (generally, the scanning linesdo not directly affect the price) is included in this technical idea.

The position includes a position on a moving route. The length islimited to a length related to the nature of an object, and includes awidth, a height, a thickness, and so on (a handling unit of an articleitself (the length of a wire and so on) is excluded). The distancerefers to the length between two points, and includes even a step and alevel difference. The volume also includes bulk and so on (however,limited to the volume related to the nature of an object, and the volumeof an article itself such as a gas, a liquid and so on belongs to“quantity”). The weight is limited to the weight related to the natureof an object, and the weight of an article itself belongs to “quantity”.The quantity refers to the number (the number of articles and so on) orthe amount (however, only limited to the quantity of an article itself(volume, weight, length (the length of a wire and so on), and the spaceand weight indicative of the nature of an object are excluded). Theevaluation numerical value refers to a numerical value (includingspecification and so on) indicative of the performance and quality of anobject used in an article or a service.

The positional relationship is a concept which includes the distancebetween a desired position and a bid position, a step on a moving routebetween both positions, a level difference between both positions, apositional relationship considering a time required for a travel betweenboth positions, and so on.

1. A method for automatically facilitating an auction performed via acomputer-implemented network wherein a plurality of bidders competebased on a time parameter to acquire a trade proposed by a requester,wherein each of a plurality of bidders is prompted to submit atime-based bid to be compared against a due date and a time slidepreference to be most satisfied by a winning bid for the trade, the timeslide preference representing a desired time-wise proximity of a tradingevent selectively preceding, or subsequent to, the due date, the methodcomprising: in a request servicing procedure, responding, by aserver-side system, to an access via a terminal of the requester whichdisplays a request entry screen prompting the requester to enter requestinformation including the due date and the time slide preference, byreceiving the request information via the terminal of the requester; ina bid procedure, responding, by the server-side system, to an access viaa terminal of each of the plurality of bidders that displays a bidscreen on the terminal of each of the plurality of bidders to prompteach bidder to enter bid information including a proposed time, byreceiving the bid information via the terminal of each bidder; and in abid acceptance procedure, executing, by the server-side system, bidprocessing for determining a winning bid using at least the proposedtime offered by each of the bidders in the bid information, and inaccordance with the due date and the time slide preference, wherein thewinning bid is determined as a bid that meets the due date and mostsatisfies the time slide preference relative to other bids.
 2. Theauction method according to claim 1, wherein: in the bid acceptanceprocedure, determining, by the server-side system, a priority order forqualifying bids that satisfy the due date, wherein the ordering is basedon a degree to which each of the qualifying bids meets the time slidepreference.
 3. The auction method according to claim 1, wherein the duedate relates to payment terms of the trade.
 4. The auction methodaccording to claim 1, wherein the due date relates to delivery terms ofthe trade.
 5. The auction method according to claim 1, wherein: the duedate represents at least one of a duration and a deadline, wherein theduration has a starting point, and wherein the deadline is defined as atime at the conclusion of the duration.
 6. The auction method accordingto claim 5, wherein: the duration defines at least one of: a waitingduration imposed on the requester who is to receive provision of anarticle or a service until the requester receives the provision of thearticle or the service, a waiting time imposed on the requester whooffers an article or a service until the requester receives a paymentfor the article or the service, and a transit time imposed on therequester who receives provision of another service required for a moveto a place at which the requester is to receive the provision of thearticle or the service.
 7. The auction method according to claim 5,wherein: the duration is defined as a transit time corresponding totransporting an article from a source to a destination, the durationbeing selected from the group consisting of: a waiting time imposed onthe requester who is to receive the article until delivery of thearticle, a moving time required for a transportation of the article to alocation at which the requester is to receive the article, or anycombination thereof.
 8. The auction method according to claim 7,wherein: in the bid procedure, the server-side system receives, via aterminal of each of the bidders, variation factor informationrepresenting factors potentially causing variations in the duration, andreceives bid information that further includes the variation factorinformation via the terminal of the bidder; and in the bid acceptanceprocedure, the server-side system corrects the duration using thevariation factor information, and executes the bid processing based oncorrection of the duration.
 9. The auction method according to claim 7,wherein: in the bid acceptance procedure, the server-side systemacquires variation factor information of the duration from an externalsource via a communication, corrects the duration using the timevariation factor information, and executes the bid processing with acorrected duration.
 10. The auction method according to claim 5, whereinthe duration is a transit time necessary for a carrying out of atransportation service to transport a person or an object between aplace specified by a person who is to receive the provision of thetransportation service and a place specified by a person who offers thetransportation service.
 11. The auction method according to claim 10,wherein: the duration is a waiting time imposed on the requester whenthe bidder goes to a position specified by the requester between aposition specified by the requester who is to receive the provision ofthe service and a position offered by the bidder who offers the service;in the request servicing procedure, the server-side system prompts therequester to offer a position to which the bidder should go, on therequest entry screen, and receives the request information including theposition via the terminal of the requester; in the bid procedure, theserver-side system prompts the bidder to offer, via the bid screen, atleast one of (i) the waiting time and (ii) a position required tocalculate the waiting time, and receives bid information including theat least one of (i) and (ii) via the terminal of the bidder; and in thebid acceptance procedure, the server-side system executes the bidprocessing according to success criteria that assigns a highest priorityto a shortest waiting time.
 12. The auction method according to claim10, wherein: the duration is a moving time imposed on the requester whenthe requester goes to a position specified by the bidder between aposition specified by the requester who offers a service and a positionoffered by the bidder who is to receive the provision of the service; inthe request servicing procedure, the server-side system prompts therequester to offer the position of the requester on the request entryscreen, and receives the request information including the position, viathe terminal of the requester; in the bid procedure, the server-sidesystem prompts the bidder to offer at least one of (i) the moving timeand (ii) a position required to calculate the moving time on the bidscreen, and receives bid information including the at least one of (i)and (ii) via the terminal of the bidder; and in the bid acceptanceprocedure, the server-side system executes the bid processing with themoving time under a success criteria that assigns a highest priority toa shortest moving time.
 13. The auction method according to claim 5,wherein: the requester is a person who receives a service, the bidder isa person who offers the service and is en route for offering theservice, and the duration represents a waiting time imposed on therequester when the bidder moves from a position on a scheduled route ata desired time of the requester to a position specified by therequester; in the request servicing procedure, the server-side systemprompts the requester to offer the position and the desired time via therequest entry screen, and receives the request information including theposition and the desired time via the terminal of the requester; in thebid procedure, the server-side system prompts the bidder to offer bidinformation including a scheduled route required to calculate thewaiting time on the bid screen, and receives the bid informationincluding the scheduled route data via the terminal of the bidder; andin the bid acceptance procedure, the server-side system uses receiveddata including the position, the desired time and the scheduled route tocalculate a waiting time imposed on the requester representing aduration of movement of the bidder from the position at the desired timeon the scheduled route to a position specified by the requester forproviding the service, and executes the bid processing based on thewaiting time and applying a success criteria that assigns a highestpriority to a shortest waiting time.
 14. The auction method according toclaim 5, wherein: the requester is a person who provides a service andis en route for providing the service, the bidder is a person whoreceives the service, and the duration is a moving time imposed on therequester when the requester moves from a position on a scheduled routeat a desired time of the bidder to a position specified by the bidder;in the request servicing procedure, the server-side system prompts therequester to offer a scheduled route on the request entry screen, andreceives the request information additionally including the scheduledroute via the terminal of the requester; in the bid procedure, theserver-side system prompts the bidder to offer the position and thedesired time on the bid screen, and receives the bid informationincluding the position and the desired time via the terminal of thebidder; and in the bid acceptance procedure, the server-side system usesreceived information including the position, the desired time and thescheduled route to calculate a moving time imposed on the requesterrepresenting a duration when the requester moves from a position at thedesired time on the scheduled route to the position specified by thebidder for providing the service, and executes the bid processing basedon the moving time and applying a success criteria that assigns ahighest priority to the shortest moving time.
 15. The auction methodaccording to claim 5, wherein: a service to be traded uses a vehicle,the duration is a at least one of a waiting time and a moving timeimposed on the requester when a provider of the service moves thevehicle to a position offered by the person who is to receive theservice.
 16. The auction method according to claim 5, wherein: theduration is at least one of a waiting time and a moving time; the bidinformation offered by the bidder includes position data of the bidderrequired for calculating the duration; and in the bid acceptanceprocedure, the server-side system uses position data specified by therequester and position data offered by the bidder to calculate theduration, and executes the bid processing based on the duration to whichsuccess criteria is applied that assigns a highest priority to ashortest duration.
 17. The auction method according to claim 1, wherein:the due date represents a trading deadline and the time slide preferenceindicates a preference for an earliest performance prior to the tradingdeadline.
 18. The auction method according to claim 1, wherein: the duedate represents a trading deadline and the time slide preferenceindicates a preference for a latest performance prior to the tradingdeadline.
 19. The auction method according to claim 1, wherein: the duedate represents a trading deadline and the time slide preferenceindicates a preference for a latest performance after the tradingdeadline.
 20. The auction method according to claim 1, wherein: the duedate represents a trading deadline and the time slide preferenceindicates a preference for an earliest performance after the tradingdeadline.